./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/heap-manipulation/merge_sort-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e8d55036 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/heap-manipulation/merge_sort-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e47f94c757882803b8e19e21a897c3f5ab1653c3391e3b246153a1c416bdab7c --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:12:30,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:12:30,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:12:30,202 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:12:30,202 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:12:30,205 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:12:30,207 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:12:30,209 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:12:30,210 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:12:30,214 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:12:30,215 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:12:30,217 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:12:30,217 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:12:30,219 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:12:30,221 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:12:30,222 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:12:30,223 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:12:30,224 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:12:30,225 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:12:30,230 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:12:30,231 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:12:30,232 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:12:30,233 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:12:30,234 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:12:30,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:12:30,241 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:12:30,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:12:30,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:12:30,243 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:12:30,244 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:12:30,244 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:12:30,245 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:12:30,246 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:12:30,247 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:12:30,248 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:12:30,248 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:12:30,249 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:12:30,249 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:12:30,249 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:12:30,250 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:12:30,251 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:12:30,252 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 22:12:30,289 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:12:30,290 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:12:30,290 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:12:30,290 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:12:30,291 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:12:30,291 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:12:30,292 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:12:30,292 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:12:30,292 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:12:30,292 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:12:30,293 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:12:30,293 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:12:30,294 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:12:30,294 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:12:30,294 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:12:30,294 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:12:30,294 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:12:30,295 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:12:30,295 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:12:30,295 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:12:30,295 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:12:30,295 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:12:30,295 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:12:30,296 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:12:30,296 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:12:30,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:12:30,296 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:12:30,297 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:12:30,297 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 22:12:30,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 22:12:30,297 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:12:30,298 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:12:30,298 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:12:30,298 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:12:30,298 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 -> e47f94c757882803b8e19e21a897c3f5ab1653c3391e3b246153a1c416bdab7c [2023-02-15 22:12:30,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:12:30,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:12:30,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:12:30,524 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:12:30,525 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:12:30,526 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2023-02-15 22:12:31,664 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:12:31,883 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:12:31,887 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2023-02-15 22:12:31,897 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a97c5e6f/5d1d1140830a42e2b466a166358c40d3/FLAG8f5e30808 [2023-02-15 22:12:31,907 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a97c5e6f/5d1d1140830a42e2b466a166358c40d3 [2023-02-15 22:12:31,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:12:31,910 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:12:31,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:12:31,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:12:31,914 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:12:31,914 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:12:31" (1/1) ... [2023-02-15 22:12:31,915 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c86ed52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:31, skipping insertion in model container [2023-02-15 22:12:31,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:12:31" (1/1) ... [2023-02-15 22:12:31,924 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:12:31,967 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:12:32,240 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/heap-manipulation/merge_sort-2.i[22632,22645] [2023-02-15 22:12:32,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:12:32,289 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:12:32,313 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/heap-manipulation/merge_sort-2.i[22632,22645] [2023-02-15 22:12:32,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:12:32,357 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:12:32,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:32 WrapperNode [2023-02-15 22:12:32,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:12:32,359 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:12:32,359 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:12:32,359 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:12:32,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:32" (1/1) ... [2023-02-15 22:12:32,392 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:32" (1/1) ... [2023-02-15 22:12:32,414 INFO L138 Inliner]: procedures = 125, calls = 83, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 294 [2023-02-15 22:12:32,415 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:12:32,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:12:32,416 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:12:32,416 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:12:32,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:32" (1/1) ... [2023-02-15 22:12:32,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:32" (1/1) ... [2023-02-15 22:12:32,431 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:32" (1/1) ... [2023-02-15 22:12:32,437 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:32" (1/1) ... [2023-02-15 22:12:32,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:32" (1/1) ... [2023-02-15 22:12:32,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:32" (1/1) ... [2023-02-15 22:12:32,466 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:32" (1/1) ... [2023-02-15 22:12:32,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:32" (1/1) ... [2023-02-15 22:12:32,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:12:32,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:12:32,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:12:32,471 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:12:32,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:32" (1/1) ... [2023-02-15 22:12:32,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:12:32,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:12:32,497 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 22:12:32,498 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 22:12:32,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 22:12:32,524 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2023-02-15 22:12:32,524 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2023-02-15 22:12:32,524 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-02-15 22:12:32,524 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-02-15 22:12:32,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 22:12:32,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 22:12:32,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:12:32,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 22:12:32,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 22:12:32,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 22:12:32,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 22:12:32,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 22:12:32,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:12:32,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:12:32,630 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:12:32,632 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:12:33,258 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:12:33,265 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:12:33,265 INFO L300 CfgBuilder]: Removed 33 assume(true) statements. [2023-02-15 22:12:33,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:12:33 BoogieIcfgContainer [2023-02-15 22:12:33,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:12:33,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:12:33,269 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:12:33,272 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:12:33,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:12:31" (1/3) ... [2023-02-15 22:12:33,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1287582d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:12:33, skipping insertion in model container [2023-02-15 22:12:33,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:32" (2/3) ... [2023-02-15 22:12:33,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1287582d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:12:33, skipping insertion in model container [2023-02-15 22:12:33,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:12:33" (3/3) ... [2023-02-15 22:12:33,277 INFO L112 eAbstractionObserver]: Analyzing ICFG merge_sort-2.i [2023-02-15 22:12:33,291 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:12:33,292 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 105 error locations. [2023-02-15 22:12:33,342 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:12:33,348 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;@2dd8a8b4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:12:33,349 INFO L358 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2023-02-15 22:12:33,354 INFO L276 IsEmpty]: Start isEmpty. Operand has 262 states, 139 states have (on average 2.194244604316547) internal successors, (305), 259 states have internal predecessors, (305), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-15 22:12:33,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-15 22:12:33,359 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:33,360 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 22:12:33,361 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:12:33,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:33,368 INFO L85 PathProgramCache]: Analyzing trace with hash 56404890, now seen corresponding path program 1 times [2023-02-15 22:12:33,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:33,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958765914] [2023-02-15 22:12:33,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:33,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:33,494 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 22:12:33,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:33,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958765914] [2023-02-15 22:12:33,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958765914] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:33,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:33,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:12:33,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735397061] [2023-02-15 22:12:33,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:33,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 22:12:33,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:33,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 22:12:33,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 22:12:33,529 INFO L87 Difference]: Start difference. First operand has 262 states, 139 states have (on average 2.194244604316547) internal successors, (305), 259 states have internal predecessors, (305), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:33,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:33,578 INFO L93 Difference]: Finished difference Result 260 states and 285 transitions. [2023-02-15 22:12:33,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 22:12:33,579 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-15 22:12:33,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:33,589 INFO L225 Difference]: With dead ends: 260 [2023-02-15 22:12:33,589 INFO L226 Difference]: Without dead ends: 258 [2023-02-15 22:12:33,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 22:12:33,601 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:33,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:12:33,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2023-02-15 22:12:33,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2023-02-15 22:12:33,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 137 states have (on average 1.9416058394160585) internal successors, (266), 255 states have internal predecessors, (266), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:12:33,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 283 transitions. [2023-02-15 22:12:33,645 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 283 transitions. Word has length 5 [2023-02-15 22:12:33,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:33,646 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 283 transitions. [2023-02-15 22:12:33,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:33,646 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 283 transitions. [2023-02-15 22:12:33,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 22:12:33,647 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:33,647 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 22:12:33,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 22:12:33,647 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:12:33,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:33,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1747491005, now seen corresponding path program 1 times [2023-02-15 22:12:33,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:33,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770485485] [2023-02-15 22:12:33,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:33,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:33,683 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 22:12:33,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:33,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770485485] [2023-02-15 22:12:33,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770485485] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:33,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:33,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:12:33,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140027762] [2023-02-15 22:12:33,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:33,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:12:33,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:33,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:12:33,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:12:33,687 INFO L87 Difference]: Start difference. First operand 258 states and 283 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:33,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:33,870 INFO L93 Difference]: Finished difference Result 391 states and 435 transitions. [2023-02-15 22:12:33,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:12:33,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 22:12:33,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:33,873 INFO L225 Difference]: With dead ends: 391 [2023-02-15 22:12:33,873 INFO L226 Difference]: Without dead ends: 390 [2023-02-15 22:12:33,873 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 22:12:33,875 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 133 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:33,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 396 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:12:33,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2023-02-15 22:12:33,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 261. [2023-02-15 22:12:33,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 140 states have (on average 1.9285714285714286) internal successors, (270), 258 states have internal predecessors, (270), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:12:33,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 287 transitions. [2023-02-15 22:12:33,923 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 287 transitions. Word has length 6 [2023-02-15 22:12:33,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:33,923 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 287 transitions. [2023-02-15 22:12:33,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:33,924 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 287 transitions. [2023-02-15 22:12:33,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 22:12:33,924 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:33,925 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 22:12:33,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 22:12:33,926 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:12:33,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:33,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1747491563, now seen corresponding path program 1 times [2023-02-15 22:12:33,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:33,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486665644] [2023-02-15 22:12:33,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:33,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:34,038 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 22:12:34,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:34,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486665644] [2023-02-15 22:12:34,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486665644] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:34,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:34,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:12:34,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214749254] [2023-02-15 22:12:34,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:34,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:12:34,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:34,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:12:34,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:12:34,042 INFO L87 Difference]: Start difference. First operand 261 states and 287 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:34,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:34,311 INFO L93 Difference]: Finished difference Result 439 states and 489 transitions. [2023-02-15 22:12:34,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:12:34,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 22:12:34,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:34,314 INFO L225 Difference]: With dead ends: 439 [2023-02-15 22:12:34,314 INFO L226 Difference]: Without dead ends: 439 [2023-02-15 22:12:34,315 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 22:12:34,316 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 199 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:34,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 569 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:12:34,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2023-02-15 22:12:34,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 259. [2023-02-15 22:12:34,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 140 states have (on average 1.9142857142857144) internal successors, (268), 256 states have internal predecessors, (268), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:12:34,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 285 transitions. [2023-02-15 22:12:34,336 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 285 transitions. Word has length 6 [2023-02-15 22:12:34,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:34,336 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 285 transitions. [2023-02-15 22:12:34,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:34,337 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 285 transitions. [2023-02-15 22:12:34,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 22:12:34,338 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:34,338 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 22:12:34,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 22:12:34,338 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:12:34,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:34,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1747491564, now seen corresponding path program 1 times [2023-02-15 22:12:34,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:34,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158408011] [2023-02-15 22:12:34,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:34,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:34,425 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 22:12:34,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:34,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158408011] [2023-02-15 22:12:34,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158408011] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:34,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:34,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:12:34,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581397583] [2023-02-15 22:12:34,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:34,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:12:34,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:34,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:12:34,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:12:34,430 INFO L87 Difference]: Start difference. First operand 259 states and 285 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:34,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:34,588 INFO L93 Difference]: Finished difference Result 400 states and 444 transitions. [2023-02-15 22:12:34,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:12:34,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 22:12:34,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:34,591 INFO L225 Difference]: With dead ends: 400 [2023-02-15 22:12:34,591 INFO L226 Difference]: Without dead ends: 400 [2023-02-15 22:12:34,591 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 22:12:34,602 INFO L413 NwaCegarLoop]: 387 mSDtfsCounter, 162 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:34,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 560 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:12:34,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2023-02-15 22:12:34,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 257. [2023-02-15 22:12:34,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 140 states have (on average 1.9) internal successors, (266), 254 states have internal predecessors, (266), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:12:34,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 283 transitions. [2023-02-15 22:12:34,626 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 283 transitions. Word has length 6 [2023-02-15 22:12:34,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:34,626 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 283 transitions. [2023-02-15 22:12:34,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:34,626 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 283 transitions. [2023-02-15 22:12:34,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 22:12:34,628 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:34,628 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:12:34,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 22:12:34,629 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:12:34,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:34,629 INFO L85 PathProgramCache]: Analyzing trace with hash 6274696, now seen corresponding path program 1 times [2023-02-15 22:12:34,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:34,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676601318] [2023-02-15 22:12:34,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:34,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:34,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:34,667 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 22:12:34,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:34,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676601318] [2023-02-15 22:12:34,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676601318] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:34,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:34,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:12:34,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802576449] [2023-02-15 22:12:34,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:34,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:12:34,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:34,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:12:34,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:12:34,670 INFO L87 Difference]: Start difference. First operand 257 states and 283 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:34,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:34,695 INFO L93 Difference]: Finished difference Result 272 states and 296 transitions. [2023-02-15 22:12:34,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:12:34,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-15 22:12:34,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:34,697 INFO L225 Difference]: With dead ends: 272 [2023-02-15 22:12:34,698 INFO L226 Difference]: Without dead ends: 271 [2023-02-15 22:12:34,698 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 22:12:34,699 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 14 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:34,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 537 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:12:34,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-02-15 22:12:34,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 256. [2023-02-15 22:12:34,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 139 states have (on average 1.8992805755395683) internal successors, (264), 253 states have internal predecessors, (264), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:12:34,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 281 transitions. [2023-02-15 22:12:34,704 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 281 transitions. Word has length 8 [2023-02-15 22:12:34,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:34,704 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 281 transitions. [2023-02-15 22:12:34,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:34,705 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 281 transitions. [2023-02-15 22:12:34,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 22:12:34,705 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:34,705 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:12:34,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 22:12:34,705 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:12:34,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:34,706 INFO L85 PathProgramCache]: Analyzing trace with hash -849555632, now seen corresponding path program 1 times [2023-02-15 22:12:34,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:34,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466224631] [2023-02-15 22:12:34,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:34,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:34,833 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 22:12:34,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:34,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466224631] [2023-02-15 22:12:34,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466224631] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:34,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:34,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:12:34,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117739992] [2023-02-15 22:12:34,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:34,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:12:34,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:34,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:12:34,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:12:34,836 INFO L87 Difference]: Start difference. First operand 256 states and 281 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:34,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:34,973 INFO L93 Difference]: Finished difference Result 342 states and 375 transitions. [2023-02-15 22:12:34,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:12:34,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-15 22:12:34,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:34,976 INFO L225 Difference]: With dead ends: 342 [2023-02-15 22:12:34,976 INFO L226 Difference]: Without dead ends: 342 [2023-02-15 22:12:34,976 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 22:12:34,978 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 160 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:34,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 346 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:12:34,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2023-02-15 22:12:34,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 254. [2023-02-15 22:12:34,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 139 states have (on average 1.8848920863309353) internal successors, (262), 251 states have internal predecessors, (262), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:12:34,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 279 transitions. [2023-02-15 22:12:34,987 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 279 transitions. Word has length 11 [2023-02-15 22:12:34,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:34,987 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 279 transitions. [2023-02-15 22:12:34,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:34,987 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 279 transitions. [2023-02-15 22:12:34,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 22:12:34,988 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:34,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:12:34,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 22:12:34,989 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:12:34,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:34,989 INFO L85 PathProgramCache]: Analyzing trace with hash -849555633, now seen corresponding path program 1 times [2023-02-15 22:12:34,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:34,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441889107] [2023-02-15 22:12:34,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:34,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:35,045 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 22:12:35,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:35,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441889107] [2023-02-15 22:12:35,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441889107] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:35,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:35,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:12:35,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130870949] [2023-02-15 22:12:35,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:35,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:12:35,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:35,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:12:35,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:12:35,048 INFO L87 Difference]: Start difference. First operand 254 states and 279 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:35,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:35,215 INFO L93 Difference]: Finished difference Result 377 states and 416 transitions. [2023-02-15 22:12:35,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:12:35,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-15 22:12:35,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:35,219 INFO L225 Difference]: With dead ends: 377 [2023-02-15 22:12:35,219 INFO L226 Difference]: Without dead ends: 377 [2023-02-15 22:12:35,219 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 22:12:35,220 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 193 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:35,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 312 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:12:35,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2023-02-15 22:12:35,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 252. [2023-02-15 22:12:35,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 139 states have (on average 1.870503597122302) internal successors, (260), 249 states have internal predecessors, (260), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:12:35,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 277 transitions. [2023-02-15 22:12:35,229 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 277 transitions. Word has length 11 [2023-02-15 22:12:35,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:35,229 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 277 transitions. [2023-02-15 22:12:35,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:35,230 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 277 transitions. [2023-02-15 22:12:35,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 22:12:35,230 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:35,230 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:12:35,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 22:12:35,232 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:12:35,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:35,233 INFO L85 PathProgramCache]: Analyzing trace with hash 321246795, now seen corresponding path program 1 times [2023-02-15 22:12:35,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:35,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375324247] [2023-02-15 22:12:35,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:35,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:35,309 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 22:12:35,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:35,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375324247] [2023-02-15 22:12:35,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375324247] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:35,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:35,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:12:35,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139775026] [2023-02-15 22:12:35,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:35,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:12:35,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:35,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:12:35,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:12:35,312 INFO L87 Difference]: Start difference. First operand 252 states and 277 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:35,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:35,361 INFO L93 Difference]: Finished difference Result 407 states and 447 transitions. [2023-02-15 22:12:35,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:12:35,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-15 22:12:35,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:35,365 INFO L225 Difference]: With dead ends: 407 [2023-02-15 22:12:35,365 INFO L226 Difference]: Without dead ends: 407 [2023-02-15 22:12:35,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:12:35,368 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 602 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:35,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 508 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:12:35,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2023-02-15 22:12:35,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 252. [2023-02-15 22:12:35,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 139 states have (on average 1.8633093525179856) internal successors, (259), 249 states have internal predecessors, (259), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:12:35,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 276 transitions. [2023-02-15 22:12:35,375 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 276 transitions. Word has length 17 [2023-02-15 22:12:35,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:35,376 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 276 transitions. [2023-02-15 22:12:35,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:35,376 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 276 transitions. [2023-02-15 22:12:35,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 22:12:35,377 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:35,377 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:12:35,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 22:12:35,377 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:12:35,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:35,378 INFO L85 PathProgramCache]: Analyzing trace with hash -519843690, now seen corresponding path program 1 times [2023-02-15 22:12:35,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:35,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139926278] [2023-02-15 22:12:35,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:35,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:35,463 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 22:12:35,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:35,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139926278] [2023-02-15 22:12:35,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139926278] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:35,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:35,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:12:35,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10827575] [2023-02-15 22:12:35,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:35,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:12:35,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:35,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:12:35,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:12:35,466 INFO L87 Difference]: Start difference. First operand 252 states and 276 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:35,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:35,608 INFO L93 Difference]: Finished difference Result 714 states and 789 transitions. [2023-02-15 22:12:35,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:12:35,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-15 22:12:35,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:35,611 INFO L225 Difference]: With dead ends: 714 [2023-02-15 22:12:35,611 INFO L226 Difference]: Without dead ends: 714 [2023-02-15 22:12:35,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:12:35,612 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 1479 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1481 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:35,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1481 Valid, 705 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:12:35,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2023-02-15 22:12:35,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 280. [2023-02-15 22:12:35,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 168 states have (on average 1.8571428571428572) internal successors, (312), 277 states have internal predecessors, (312), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:12:35,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 328 transitions. [2023-02-15 22:12:35,620 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 328 transitions. Word has length 19 [2023-02-15 22:12:35,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:35,620 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 328 transitions. [2023-02-15 22:12:35,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:35,621 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 328 transitions. [2023-02-15 22:12:35,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 22:12:35,621 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:35,621 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:12:35,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 22:12:35,622 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:12:35,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:35,622 INFO L85 PathProgramCache]: Analyzing trace with hash -519854939, now seen corresponding path program 1 times [2023-02-15 22:12:35,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:35,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321890628] [2023-02-15 22:12:35,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:35,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:35,695 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 22:12:35,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:35,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321890628] [2023-02-15 22:12:35,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321890628] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:35,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:35,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:12:35,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963847165] [2023-02-15 22:12:35,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:35,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:12:35,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:35,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:12:35,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:12:35,697 INFO L87 Difference]: Start difference. First operand 280 states and 328 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:36,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:36,017 INFO L93 Difference]: Finished difference Result 466 states and 533 transitions. [2023-02-15 22:12:36,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:12:36,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-15 22:12:36,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:36,020 INFO L225 Difference]: With dead ends: 466 [2023-02-15 22:12:36,020 INFO L226 Difference]: Without dead ends: 466 [2023-02-15 22:12:36,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:12:36,022 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 646 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:36,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 547 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:12:36,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2023-02-15 22:12:36,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 271. [2023-02-15 22:12:36,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 168 states have (on average 1.7857142857142858) internal successors, (300), 268 states have internal predecessors, (300), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:12:36,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 316 transitions. [2023-02-15 22:12:36,031 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 316 transitions. Word has length 19 [2023-02-15 22:12:36,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:36,032 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 316 transitions. [2023-02-15 22:12:36,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:36,032 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 316 transitions. [2023-02-15 22:12:36,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 22:12:36,032 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:36,033 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:12:36,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 22:12:36,034 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:12:36,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:36,035 INFO L85 PathProgramCache]: Analyzing trace with hash -519854938, now seen corresponding path program 1 times [2023-02-15 22:12:36,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:36,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321274045] [2023-02-15 22:12:36,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:36,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:36,172 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 22:12:36,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:36,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321274045] [2023-02-15 22:12:36,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321274045] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:36,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:36,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:12:36,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146131350] [2023-02-15 22:12:36,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:36,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:12:36,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:36,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:12:36,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:12:36,175 INFO L87 Difference]: Start difference. First operand 271 states and 316 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:36,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:36,532 INFO L93 Difference]: Finished difference Result 606 states and 668 transitions. [2023-02-15 22:12:36,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:12:36,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-15 22:12:36,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:36,535 INFO L225 Difference]: With dead ends: 606 [2023-02-15 22:12:36,535 INFO L226 Difference]: Without dead ends: 606 [2023-02-15 22:12:36,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:12:36,535 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 891 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:36,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 571 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:12:36,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2023-02-15 22:12:36,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 291. [2023-02-15 22:12:36,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 188 states have (on average 1.7234042553191489) internal successors, (324), 288 states have internal predecessors, (324), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:12:36,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 340 transitions. [2023-02-15 22:12:36,544 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 340 transitions. Word has length 19 [2023-02-15 22:12:36,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:36,544 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 340 transitions. [2023-02-15 22:12:36,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:36,545 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 340 transitions. [2023-02-15 22:12:36,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 22:12:36,545 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:36,546 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 22:12:36,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 22:12:36,546 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:12:36,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:36,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1987558854, now seen corresponding path program 1 times [2023-02-15 22:12:36,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:36,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003805080] [2023-02-15 22:12:36,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:36,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:36,626 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 22:12:36,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:36,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003805080] [2023-02-15 22:12:36,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003805080] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:36,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:36,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:12:36,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229013430] [2023-02-15 22:12:36,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:36,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:12:36,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:36,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:12:36,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:12:36,629 INFO L87 Difference]: Start difference. First operand 291 states and 340 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:36,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:36,780 INFO L93 Difference]: Finished difference Result 373 states and 428 transitions. [2023-02-15 22:12:36,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:12:36,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 22:12:36,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:36,783 INFO L225 Difference]: With dead ends: 373 [2023-02-15 22:12:36,783 INFO L226 Difference]: Without dead ends: 373 [2023-02-15 22:12:36,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:12:36,784 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 104 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:36,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 838 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:12:36,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2023-02-15 22:12:36,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 290. [2023-02-15 22:12:36,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 188 states have (on average 1.7127659574468086) internal successors, (322), 287 states have internal predecessors, (322), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:12:36,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 337 transitions. [2023-02-15 22:12:36,791 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 337 transitions. Word has length 26 [2023-02-15 22:12:36,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:36,791 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 337 transitions. [2023-02-15 22:12:36,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:36,792 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 337 transitions. [2023-02-15 22:12:36,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 22:12:36,792 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:36,792 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 22:12:36,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 22:12:36,793 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:12:36,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:36,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1626991364, now seen corresponding path program 1 times [2023-02-15 22:12:36,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:36,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653421687] [2023-02-15 22:12:36,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:36,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:36,886 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 22:12:36,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:36,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653421687] [2023-02-15 22:12:36,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653421687] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:36,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:36,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:12:36,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676369706] [2023-02-15 22:12:36,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:36,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:12:36,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:36,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:12:36,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:12:36,889 INFO L87 Difference]: Start difference. First operand 290 states and 337 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:37,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:37,024 INFO L93 Difference]: Finished difference Result 289 states and 334 transitions. [2023-02-15 22:12:37,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:12:37,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 22:12:37,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:37,026 INFO L225 Difference]: With dead ends: 289 [2023-02-15 22:12:37,026 INFO L226 Difference]: Without dead ends: 289 [2023-02-15 22:12:37,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:12:37,027 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 20 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:37,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 863 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:12:37,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2023-02-15 22:12:37,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2023-02-15 22:12:37,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 188 states have (on average 1.702127659574468) internal successors, (320), 286 states have internal predecessors, (320), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:12:37,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 334 transitions. [2023-02-15 22:12:37,034 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 334 transitions. Word has length 26 [2023-02-15 22:12:37,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:37,035 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 334 transitions. [2023-02-15 22:12:37,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:37,035 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 334 transitions. [2023-02-15 22:12:37,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 22:12:37,036 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:37,036 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] [2023-02-15 22:12:37,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 22:12:37,036 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:12:37,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:37,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1169692160, now seen corresponding path program 1 times [2023-02-15 22:12:37,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:37,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209232732] [2023-02-15 22:12:37,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:37,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:37,272 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 22:12:37,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:37,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209232732] [2023-02-15 22:12:37,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209232732] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:37,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:37,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 22:12:37,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189241733] [2023-02-15 22:12:37,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:37,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:12:37,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:37,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:12:37,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:12:37,275 INFO L87 Difference]: Start difference. First operand 289 states and 334 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:37,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:37,507 INFO L93 Difference]: Finished difference Result 602 states and 659 transitions. [2023-02-15 22:12:37,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:12:37,508 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-15 22:12:37,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:37,522 INFO L225 Difference]: With dead ends: 602 [2023-02-15 22:12:37,523 INFO L226 Difference]: Without dead ends: 602 [2023-02-15 22:12:37,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-02-15 22:12:37,524 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 1288 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:37,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1290 Valid, 1037 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:12:37,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2023-02-15 22:12:37,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 289. [2023-02-15 22:12:37,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 188 states have (on average 1.696808510638298) internal successors, (319), 286 states have internal predecessors, (319), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:12:37,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 333 transitions. [2023-02-15 22:12:37,533 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 333 transitions. Word has length 29 [2023-02-15 22:12:37,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:37,533 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 333 transitions. [2023-02-15 22:12:37,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:37,533 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 333 transitions. [2023-02-15 22:12:37,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 22:12:37,534 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:37,534 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] [2023-02-15 22:12:37,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 22:12:37,535 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:12:37,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:37,535 INFO L85 PathProgramCache]: Analyzing trace with hash 698957523, now seen corresponding path program 1 times [2023-02-15 22:12:37,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:37,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213262975] [2023-02-15 22:12:37,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:37,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:37,676 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 22:12:37,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:37,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213262975] [2023-02-15 22:12:37,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213262975] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:37,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:37,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 22:12:37,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603404595] [2023-02-15 22:12:37,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:37,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:12:37,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:37,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:12:37,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:12:37,678 INFO L87 Difference]: Start difference. First operand 289 states and 333 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:37,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:37,924 INFO L93 Difference]: Finished difference Result 601 states and 657 transitions. [2023-02-15 22:12:37,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:12:37,924 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-15 22:12:37,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:37,927 INFO L225 Difference]: With dead ends: 601 [2023-02-15 22:12:37,927 INFO L226 Difference]: Without dead ends: 601 [2023-02-15 22:12:37,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-02-15 22:12:37,929 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 1284 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1286 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:37,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1286 Valid, 1037 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:12:37,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2023-02-15 22:12:37,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 289. [2023-02-15 22:12:37,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 188 states have (on average 1.6914893617021276) internal successors, (318), 286 states have internal predecessors, (318), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:12:37,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 332 transitions. [2023-02-15 22:12:37,936 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 332 transitions. Word has length 29 [2023-02-15 22:12:37,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:37,936 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 332 transitions. [2023-02-15 22:12:37,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:37,937 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 332 transitions. [2023-02-15 22:12:37,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 22:12:37,939 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:37,939 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] [2023-02-15 22:12:37,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 22:12:37,939 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:12:37,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:37,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1900933732, now seen corresponding path program 1 times [2023-02-15 22:12:37,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:37,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184664532] [2023-02-15 22:12:37,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:37,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:38,161 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 22:12:38,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:38,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184664532] [2023-02-15 22:12:38,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184664532] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:38,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:38,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 22:12:38,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963468093] [2023-02-15 22:12:38,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:38,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 22:12:38,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:38,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 22:12:38,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:12:38,163 INFO L87 Difference]: Start difference. First operand 289 states and 332 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:38,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:38,753 INFO L93 Difference]: Finished difference Result 674 states and 745 transitions. [2023-02-15 22:12:38,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 22:12:38,754 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-02-15 22:12:38,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:38,756 INFO L225 Difference]: With dead ends: 674 [2023-02-15 22:12:38,756 INFO L226 Difference]: Without dead ends: 674 [2023-02-15 22:12:38,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2023-02-15 22:12:38,757 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 1605 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1607 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:38,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1607 Valid, 806 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 22:12:38,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2023-02-15 22:12:38,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 290. [2023-02-15 22:12:38,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 189 states have (on average 1.693121693121693) internal successors, (320), 287 states have internal predecessors, (320), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:12:38,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 334 transitions. [2023-02-15 22:12:38,767 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 334 transitions. Word has length 30 [2023-02-15 22:12:38,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:38,767 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 334 transitions. [2023-02-15 22:12:38,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:38,767 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 334 transitions. [2023-02-15 22:12:38,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 22:12:38,769 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:38,769 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] [2023-02-15 22:12:38,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 22:12:38,769 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:12:38,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:38,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1900933731, now seen corresponding path program 1 times [2023-02-15 22:12:38,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:38,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352440929] [2023-02-15 22:12:38,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:38,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:39,110 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 22:12:39,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:39,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352440929] [2023-02-15 22:12:39,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352440929] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:39,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:39,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 22:12:39,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119208203] [2023-02-15 22:12:39,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:39,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 22:12:39,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:39,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 22:12:39,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:12:39,113 INFO L87 Difference]: Start difference. First operand 290 states and 334 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:40,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:40,131 INFO L93 Difference]: Finished difference Result 799 states and 878 transitions. [2023-02-15 22:12:40,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 22:12:40,132 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-02-15 22:12:40,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:40,135 INFO L225 Difference]: With dead ends: 799 [2023-02-15 22:12:40,135 INFO L226 Difference]: Without dead ends: 799 [2023-02-15 22:12:40,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2023-02-15 22:12:40,136 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 1781 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1781 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:40,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1781 Valid, 882 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 22:12:40,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2023-02-15 22:12:40,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 290. [2023-02-15 22:12:40,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 189 states have (on average 1.687830687830688) internal successors, (319), 287 states have internal predecessors, (319), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:12:40,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 333 transitions. [2023-02-15 22:12:40,146 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 333 transitions. Word has length 30 [2023-02-15 22:12:40,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:40,147 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 333 transitions. [2023-02-15 22:12:40,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:40,147 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 333 transitions. [2023-02-15 22:12:40,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 22:12:40,150 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:40,151 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] [2023-02-15 22:12:40,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 22:12:40,151 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:12:40,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:40,151 INFO L85 PathProgramCache]: Analyzing trace with hash 192556862, now seen corresponding path program 1 times [2023-02-15 22:12:40,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:40,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234394590] [2023-02-15 22:12:40,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:40,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:40,376 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 22:12:40,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:40,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234394590] [2023-02-15 22:12:40,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234394590] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:40,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:40,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 22:12:40,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086004222] [2023-02-15 22:12:40,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:40,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 22:12:40,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:40,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 22:12:40,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:12:40,379 INFO L87 Difference]: Start difference. First operand 290 states and 333 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:40,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:40,917 INFO L93 Difference]: Finished difference Result 672 states and 743 transitions. [2023-02-15 22:12:40,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 22:12:40,918 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-02-15 22:12:40,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:40,921 INFO L225 Difference]: With dead ends: 672 [2023-02-15 22:12:40,921 INFO L226 Difference]: Without dead ends: 672 [2023-02-15 22:12:40,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2023-02-15 22:12:40,921 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 1593 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1595 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:40,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1595 Valid, 806 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:12:40,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2023-02-15 22:12:40,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 290. [2023-02-15 22:12:40,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 189 states have (on average 1.6825396825396826) internal successors, (318), 287 states have internal predecessors, (318), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:12:40,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 332 transitions. [2023-02-15 22:12:40,930 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 332 transitions. Word has length 30 [2023-02-15 22:12:40,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:40,930 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 332 transitions. [2023-02-15 22:12:40,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:40,930 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 332 transitions. [2023-02-15 22:12:40,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 22:12:40,931 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:40,931 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] [2023-02-15 22:12:40,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-15 22:12:40,931 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:12:40,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:40,932 INFO L85 PathProgramCache]: Analyzing trace with hash 192556863, now seen corresponding path program 1 times [2023-02-15 22:12:40,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:40,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348613080] [2023-02-15 22:12:40,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:40,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:41,262 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 22:12:41,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:41,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348613080] [2023-02-15 22:12:41,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348613080] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:41,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:41,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 22:12:41,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438396172] [2023-02-15 22:12:41,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:41,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:12:41,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:41,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:12:41,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:12:41,265 INFO L87 Difference]: Start difference. First operand 290 states and 332 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:42,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:42,134 INFO L93 Difference]: Finished difference Result 797 states and 876 transitions. [2023-02-15 22:12:42,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 22:12:42,135 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-02-15 22:12:42,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:42,138 INFO L225 Difference]: With dead ends: 797 [2023-02-15 22:12:42,138 INFO L226 Difference]: Without dead ends: 797 [2023-02-15 22:12:42,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2023-02-15 22:12:42,139 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 1926 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1928 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:42,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1928 Valid, 868 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 22:12:42,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2023-02-15 22:12:42,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 290. [2023-02-15 22:12:42,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 189 states have (on average 1.6772486772486772) internal successors, (317), 287 states have internal predecessors, (317), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:12:42,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 331 transitions. [2023-02-15 22:12:42,149 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 331 transitions. Word has length 30 [2023-02-15 22:12:42,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:42,150 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 331 transitions. [2023-02-15 22:12:42,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:42,150 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 331 transitions. [2023-02-15 22:12:42,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 22:12:42,151 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:42,151 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 22:12:42,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-15 22:12:42,151 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:12:42,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:42,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1572782387, now seen corresponding path program 1 times [2023-02-15 22:12:42,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:42,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016287698] [2023-02-15 22:12:42,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:42,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:42,545 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 22:12:42,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:42,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016287698] [2023-02-15 22:12:42,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016287698] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:42,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:42,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 22:12:42,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969264262] [2023-02-15 22:12:42,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:42,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:12:42,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:42,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:12:42,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:12:42,548 INFO L87 Difference]: Start difference. First operand 290 states and 331 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:43,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:43,293 INFO L93 Difference]: Finished difference Result 596 states and 651 transitions. [2023-02-15 22:12:43,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 22:12:43,293 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 22:12:43,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:43,295 INFO L225 Difference]: With dead ends: 596 [2023-02-15 22:12:43,296 INFO L226 Difference]: Without dead ends: 596 [2023-02-15 22:12:43,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=316, Unknown=0, NotChecked=0, Total=462 [2023-02-15 22:12:43,296 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 1625 mSDsluCounter, 1327 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1625 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:43,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1625 Valid, 1531 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 22:12:43,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2023-02-15 22:12:43,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 291. [2023-02-15 22:12:43,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 190 states have (on average 1.6736842105263159) internal successors, (318), 288 states have internal predecessors, (318), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:12:43,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 332 transitions. [2023-02-15 22:12:43,304 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 332 transitions. Word has length 33 [2023-02-15 22:12:43,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:43,304 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 332 transitions. [2023-02-15 22:12:43,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:43,304 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 332 transitions. [2023-02-15 22:12:43,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 22:12:43,304 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:43,305 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 22:12:43,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-15 22:12:43,305 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:12:43,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:43,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1614681760, now seen corresponding path program 1 times [2023-02-15 22:12:43,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:43,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950436519] [2023-02-15 22:12:43,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:43,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:43,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:43,676 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 22:12:43,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:43,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950436519] [2023-02-15 22:12:43,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950436519] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:43,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:43,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 22:12:43,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785137467] [2023-02-15 22:12:43,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:43,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:12:43,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:43,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:12:43,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:12:43,679 INFO L87 Difference]: Start difference. First operand 291 states and 332 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:44,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:44,377 INFO L93 Difference]: Finished difference Result 595 states and 649 transitions. [2023-02-15 22:12:44,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 22:12:44,378 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 22:12:44,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:44,379 INFO L225 Difference]: With dead ends: 595 [2023-02-15 22:12:44,379 INFO L226 Difference]: Without dead ends: 595 [2023-02-15 22:12:44,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=316, Unknown=0, NotChecked=0, Total=462 [2023-02-15 22:12:44,380 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 1620 mSDsluCounter, 1327 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1620 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:44,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1620 Valid, 1531 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:12:44,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2023-02-15 22:12:44,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 291. [2023-02-15 22:12:44,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 190 states have (on average 1.668421052631579) internal successors, (317), 288 states have internal predecessors, (317), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:12:44,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 331 transitions. [2023-02-15 22:12:44,387 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 331 transitions. Word has length 33 [2023-02-15 22:12:44,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:44,387 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 331 transitions. [2023-02-15 22:12:44,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:44,387 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 331 transitions. [2023-02-15 22:12:44,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 22:12:44,388 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:44,388 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] [2023-02-15 22:12:44,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-15 22:12:44,388 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:12:44,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:44,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1234347779, now seen corresponding path program 1 times [2023-02-15 22:12:44,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:44,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408220778] [2023-02-15 22:12:44,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:44,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:44,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:12:44,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:44,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408220778] [2023-02-15 22:12:44,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408220778] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:12:44,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844026997] [2023-02-15 22:12:44,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:44,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:12:44,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:12:44,688 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 22:12:44,708 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 22:12:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:44,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-15 22:12:44,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:12:44,882 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 22:12:44,930 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 22:12:44,934 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 22:12:45,019 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:12:45,020 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 17 treesize of output 15 [2023-02-15 22:12:45,027 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:12:45,027 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 17 treesize of output 15 [2023-02-15 22:12:45,032 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 13 treesize of output 9 [2023-02-15 22:12:45,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:12:45,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:12:45,453 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 12 treesize of output 10 [2023-02-15 22:12:45,456 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 18 treesize of output 16 [2023-02-15 22:12:45,463 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 12 treesize of output 10 [2023-02-15 22:12:45,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:12:45,471 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 14 treesize of output 12 [2023-02-15 22:12:45,474 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:12:45,475 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 3 [2023-02-15 22:12:45,481 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 22:12:45,563 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:12:45,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844026997] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:12:45,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:12:45,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2023-02-15 22:12:45,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850823329] [2023-02-15 22:12:45,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:12:45,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-15 22:12:45,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:45,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-15 22:12:45,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2023-02-15 22:12:45,566 INFO L87 Difference]: Start difference. First operand 291 states and 331 transitions. Second operand has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 21 states have internal predecessors, (70), 0 states have call successors, (0), 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 22:12:46,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:46,583 INFO L93 Difference]: Finished difference Result 486 states and 543 transitions. [2023-02-15 22:12:46,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:12:46,584 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 21 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-02-15 22:12:46,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:46,586 INFO L225 Difference]: With dead ends: 486 [2023-02-15 22:12:46,586 INFO L226 Difference]: Without dead ends: 486 [2023-02-15 22:12:46,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2023-02-15 22:12:46,587 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 1120 mSDsluCounter, 2281 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 2492 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:46,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1120 Valid, 2492 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-15 22:12:46,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2023-02-15 22:12:46,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 307. [2023-02-15 22:12:46,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 206 states have (on average 1.6213592233009708) internal successors, (334), 304 states have internal predecessors, (334), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:12:46,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 348 transitions. [2023-02-15 22:12:46,593 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 348 transitions. Word has length 35 [2023-02-15 22:12:46,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:46,593 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 348 transitions. [2023-02-15 22:12:46,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 21 states have internal predecessors, (70), 0 states have call successors, (0), 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 22:12:46,593 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 348 transitions. [2023-02-15 22:12:46,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 22:12:46,594 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:46,594 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] [2023-02-15 22:12:46,603 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 22:12:46,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-02-15 22:12:46,801 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:12:46,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:46,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1275174605, now seen corresponding path program 1 times [2023-02-15 22:12:46,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:46,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090419429] [2023-02-15 22:12:46,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:46,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:46,949 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 22:12:46,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:46,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090419429] [2023-02-15 22:12:46,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090419429] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:46,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:46,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:12:46,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153583261] [2023-02-15 22:12:46,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:46,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:12:46,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:46,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:12:46,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:12:46,952 INFO L87 Difference]: Start difference. First operand 307 states and 348 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:47,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:47,257 INFO L93 Difference]: Finished difference Result 499 states and 544 transitions. [2023-02-15 22:12:47,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:12:47,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-02-15 22:12:47,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:47,259 INFO L225 Difference]: With dead ends: 499 [2023-02-15 22:12:47,259 INFO L226 Difference]: Without dead ends: 499 [2023-02-15 22:12:47,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:12:47,260 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 479 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:47,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 609 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:12:47,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2023-02-15 22:12:47,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 313. [2023-02-15 22:12:47,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 212 states have (on average 1.6273584905660377) internal successors, (345), 310 states have internal predecessors, (345), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:12:47,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 359 transitions. [2023-02-15 22:12:47,266 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 359 transitions. Word has length 37 [2023-02-15 22:12:47,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:47,266 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 359 transitions. [2023-02-15 22:12:47,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:47,267 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 359 transitions. [2023-02-15 22:12:47,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 22:12:47,267 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:47,267 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] [2023-02-15 22:12:47,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-15 22:12:47,267 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:12:47,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:47,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1275174606, now seen corresponding path program 1 times [2023-02-15 22:12:47,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:47,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76133452] [2023-02-15 22:12:47,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:47,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:47,336 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 22:12:47,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:47,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76133452] [2023-02-15 22:12:47,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76133452] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:47,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:47,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:12:47,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084331717] [2023-02-15 22:12:47,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:47,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:12:47,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:47,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:12:47,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:12:47,339 INFO L87 Difference]: Start difference. First operand 313 states and 359 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:47,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:47,688 INFO L93 Difference]: Finished difference Result 632 states and 714 transitions. [2023-02-15 22:12:47,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:12:47,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-02-15 22:12:47,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:47,690 INFO L225 Difference]: With dead ends: 632 [2023-02-15 22:12:47,691 INFO L226 Difference]: Without dead ends: 632 [2023-02-15 22:12:47,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:12:47,691 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 866 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:47,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 610 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:12:47,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2023-02-15 22:12:47,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 313. [2023-02-15 22:12:47,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 214 states have (on average 1.6074766355140186) internal successors, (344), 310 states have internal predecessors, (344), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:12:47,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 358 transitions. [2023-02-15 22:12:47,699 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 358 transitions. Word has length 37 [2023-02-15 22:12:47,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:47,700 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 358 transitions. [2023-02-15 22:12:47,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:47,700 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 358 transitions. [2023-02-15 22:12:47,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 22:12:47,700 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:47,701 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] [2023-02-15 22:12:47,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-02-15 22:12:47,701 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:12:47,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:47,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1375067782, now seen corresponding path program 1 times [2023-02-15 22:12:47,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:47,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051471893] [2023-02-15 22:12:47,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:47,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:47,770 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 22:12:47,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:47,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051471893] [2023-02-15 22:12:47,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051471893] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:47,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:47,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:12:47,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054811042] [2023-02-15 22:12:47,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:47,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:12:47,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:47,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:12:47,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:12:47,773 INFO L87 Difference]: Start difference. First operand 313 states and 358 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:47,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:47,849 INFO L93 Difference]: Finished difference Result 426 states and 467 transitions. [2023-02-15 22:12:47,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:12:47,849 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-02-15 22:12:47,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:47,851 INFO L225 Difference]: With dead ends: 426 [2023-02-15 22:12:47,851 INFO L226 Difference]: Without dead ends: 426 [2023-02-15 22:12:47,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:12:47,852 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 805 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:47,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 904 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:12:47,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2023-02-15 22:12:47,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 313. [2023-02-15 22:12:47,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 214 states have (on average 1.602803738317757) internal successors, (343), 310 states have internal predecessors, (343), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:12:47,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 357 transitions. [2023-02-15 22:12:47,861 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 357 transitions. Word has length 39 [2023-02-15 22:12:47,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:47,862 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 357 transitions. [2023-02-15 22:12:47,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:47,866 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 357 transitions. [2023-02-15 22:12:47,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 22:12:47,866 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:47,866 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] [2023-02-15 22:12:47,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-02-15 22:12:47,866 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:12:47,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:47,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1375068993, now seen corresponding path program 1 times [2023-02-15 22:12:47,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:47,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237358953] [2023-02-15 22:12:47,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:47,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:47,932 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 22:12:47,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:47,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237358953] [2023-02-15 22:12:47,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237358953] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:47,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:47,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:12:47,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23463866] [2023-02-15 22:12:47,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:47,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:12:47,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:47,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:12:47,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:12:47,935 INFO L87 Difference]: Start difference. First operand 313 states and 357 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:48,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:48,253 INFO L93 Difference]: Finished difference Result 573 states and 644 transitions. [2023-02-15 22:12:48,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:12:48,253 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-02-15 22:12:48,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:48,255 INFO L225 Difference]: With dead ends: 573 [2023-02-15 22:12:48,255 INFO L226 Difference]: Without dead ends: 573 [2023-02-15 22:12:48,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:12:48,256 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 564 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:48,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 642 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:12:48,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2023-02-15 22:12:48,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 310. [2023-02-15 22:12:48,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 214 states have (on average 1.574766355140187) internal successors, (337), 307 states have internal predecessors, (337), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:12:48,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 351 transitions. [2023-02-15 22:12:48,265 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 351 transitions. Word has length 39 [2023-02-15 22:12:48,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:48,265 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 351 transitions. [2023-02-15 22:12:48,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:48,265 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 351 transitions. [2023-02-15 22:12:48,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 22:12:48,266 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:48,266 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] [2023-02-15 22:12:48,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-02-15 22:12:48,266 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:12:48,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:48,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1375068992, now seen corresponding path program 1 times [2023-02-15 22:12:48,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:48,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921639123] [2023-02-15 22:12:48,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:48,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:48,383 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 22:12:48,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:48,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921639123] [2023-02-15 22:12:48,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921639123] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:48,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:48,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:12:48,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675380978] [2023-02-15 22:12:48,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:48,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:12:48,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:48,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:12:48,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:12:48,385 INFO L87 Difference]: Start difference. First operand 310 states and 351 transitions. Second operand has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:48,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:48,716 INFO L93 Difference]: Finished difference Result 418 states and 458 transitions. [2023-02-15 22:12:48,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:12:48,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-02-15 22:12:48,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:48,718 INFO L225 Difference]: With dead ends: 418 [2023-02-15 22:12:48,718 INFO L226 Difference]: Without dead ends: 418 [2023-02-15 22:12:48,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:12:48,719 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 356 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:48,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 557 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:12:48,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2023-02-15 22:12:48,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 310. [2023-02-15 22:12:48,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 214 states have (on average 1.560747663551402) internal successors, (334), 307 states have internal predecessors, (334), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:12:48,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 348 transitions. [2023-02-15 22:12:48,725 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 348 transitions. Word has length 39 [2023-02-15 22:12:48,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:48,725 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 348 transitions. [2023-02-15 22:12:48,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:48,725 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 348 transitions. [2023-02-15 22:12:48,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 22:12:48,725 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:48,725 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] [2023-02-15 22:12:48,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-02-15 22:12:48,725 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:12:48,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:48,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1377050303, now seen corresponding path program 1 times [2023-02-15 22:12:48,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:48,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537776648] [2023-02-15 22:12:48,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:48,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:48,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:12:48,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:48,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537776648] [2023-02-15 22:12:48,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537776648] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:48,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:48,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:12:48,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123041912] [2023-02-15 22:12:48,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:48,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:12:48,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:48,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:12:48,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:12:48,786 INFO L87 Difference]: Start difference. First operand 310 states and 348 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:48,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:48,909 INFO L93 Difference]: Finished difference Result 541 states and 594 transitions. [2023-02-15 22:12:48,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:12:48,910 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-02-15 22:12:48,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:48,911 INFO L225 Difference]: With dead ends: 541 [2023-02-15 22:12:48,911 INFO L226 Difference]: Without dead ends: 541 [2023-02-15 22:12:48,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:12:48,912 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 1089 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:48,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1091 Valid, 1014 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:12:48,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2023-02-15 22:12:48,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 310. [2023-02-15 22:12:48,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 214 states have (on average 1.5560747663551402) internal successors, (333), 307 states have internal predecessors, (333), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:12:48,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 347 transitions. [2023-02-15 22:12:48,919 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 347 transitions. Word has length 39 [2023-02-15 22:12:48,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:48,919 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 347 transitions. [2023-02-15 22:12:48,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:48,919 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 347 transitions. [2023-02-15 22:12:48,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 22:12:48,920 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:48,920 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] [2023-02-15 22:12:48,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-02-15 22:12:48,920 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:12:48,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:48,921 INFO L85 PathProgramCache]: Analyzing trace with hash 718105722, now seen corresponding path program 1 times [2023-02-15 22:12:48,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:48,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696822204] [2023-02-15 22:12:48,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:48,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:49,265 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 22:12:49,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:49,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696822204] [2023-02-15 22:12:49,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696822204] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:12:49,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280745537] [2023-02-15 22:12:49,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:49,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:12:49,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:12:49,268 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 22:12:49,296 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 22:12:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:49,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-15 22:12:49,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:12:49,451 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 13 treesize of output 9 [2023-02-15 22:12:49,455 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 13 treesize of output 9 [2023-02-15 22:12:49,590 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 22:12:49,592 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 22:12:49,598 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 22:12:49,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:12:49,754 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 22:12:49,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280745537] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:12:49,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:12:49,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 13 [2023-02-15 22:12:49,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65719875] [2023-02-15 22:12:49,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:12:49,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 22:12:49,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:49,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 22:12:49,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-02-15 22:12:49,757 INFO L87 Difference]: Start difference. First operand 310 states and 347 transitions. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:50,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:50,066 INFO L93 Difference]: Finished difference Result 390 states and 432 transitions. [2023-02-15 22:12:50,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:12:50,067 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-02-15 22:12:50,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:50,068 INFO L225 Difference]: With dead ends: 390 [2023-02-15 22:12:50,068 INFO L226 Difference]: Without dead ends: 390 [2023-02-15 22:12:50,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2023-02-15 22:12:50,069 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 356 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:50,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1458 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:12:50,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2023-02-15 22:12:50,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 330. [2023-02-15 22:12:50,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 234 states have (on average 1.5128205128205128) internal successors, (354), 327 states have internal predecessors, (354), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:12:50,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 368 transitions. [2023-02-15 22:12:50,075 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 368 transitions. Word has length 42 [2023-02-15 22:12:50,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:50,075 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 368 transitions. [2023-02-15 22:12:50,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:50,076 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 368 transitions. [2023-02-15 22:12:50,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 22:12:50,076 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:50,076 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] [2023-02-15 22:12:50,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 22:12:50,283 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,SelfDestructingSolverStorable28 [2023-02-15 22:12:50,283 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:12:50,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:50,283 INFO L85 PathProgramCache]: Analyzing trace with hash -551533569, now seen corresponding path program 1 times [2023-02-15 22:12:50,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:50,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016523047] [2023-02-15 22:12:50,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:50,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:50,606 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 22:12:50,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:50,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016523047] [2023-02-15 22:12:50,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016523047] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:12:50,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760880889] [2023-02-15 22:12:50,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:50,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:12:50,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:12:50,608 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 22:12:50,632 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 22:12:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:50,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-15 22:12:50,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:12:50,784 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 13 treesize of output 9 [2023-02-15 22:12:50,788 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 13 treesize of output 9 [2023-02-15 22:12:50,904 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 22:12:50,906 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 22:12:50,918 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 22:12:50,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:12:51,043 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 22:12:51,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760880889] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:12:51,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:12:51,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 12 [2023-02-15 22:12:51,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328261097] [2023-02-15 22:12:51,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:12:51,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 22:12:51,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:51,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 22:12:51,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-02-15 22:12:51,048 INFO L87 Difference]: Start difference. First operand 330 states and 368 transitions. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 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 22:12:51,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:51,295 INFO L93 Difference]: Finished difference Result 377 states and 417 transitions. [2023-02-15 22:12:51,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:12:51,295 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-02-15 22:12:51,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:51,297 INFO L225 Difference]: With dead ends: 377 [2023-02-15 22:12:51,297 INFO L226 Difference]: Without dead ends: 377 [2023-02-15 22:12:51,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2023-02-15 22:12:51,297 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 188 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1722 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:51,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1722 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:12:51,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2023-02-15 22:12:51,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 330. [2023-02-15 22:12:51,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 234 states have (on average 1.5085470085470085) internal successors, (353), 327 states have internal predecessors, (353), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:12:51,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 367 transitions. [2023-02-15 22:12:51,303 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 367 transitions. Word has length 41 [2023-02-15 22:12:51,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:51,303 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 367 transitions. [2023-02-15 22:12:51,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 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 22:12:51,303 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 367 transitions. [2023-02-15 22:12:51,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 22:12:51,303 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:51,304 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] [2023-02-15 22:12:51,313 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 22:12:51,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:12:51,511 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:12:51,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:51,512 INFO L85 PathProgramCache]: Analyzing trace with hash -163923031, now seen corresponding path program 1 times [2023-02-15 22:12:51,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:51,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28525199] [2023-02-15 22:12:51,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:51,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:51,742 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 22:12:51,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:51,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28525199] [2023-02-15 22:12:51,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28525199] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:51,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:51,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 22:12:51,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089143251] [2023-02-15 22:12:51,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:51,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 22:12:51,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:51,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 22:12:51,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:12:51,744 INFO L87 Difference]: Start difference. First operand 330 states and 367 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:52,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:52,200 INFO L93 Difference]: Finished difference Result 429 states and 465 transitions. [2023-02-15 22:12:52,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:12:52,201 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2023-02-15 22:12:52,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:52,202 INFO L225 Difference]: With dead ends: 429 [2023-02-15 22:12:52,203 INFO L226 Difference]: Without dead ends: 429 [2023-02-15 22:12:52,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2023-02-15 22:12:52,203 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 833 mSDsluCounter, 1652 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 1868 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:52,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 1868 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:12:52,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2023-02-15 22:12:52,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 342. [2023-02-15 22:12:52,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 246 states have (on average 1.491869918699187) internal successors, (367), 339 states have internal predecessors, (367), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:12:52,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 381 transitions. [2023-02-15 22:12:52,210 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 381 transitions. Word has length 45 [2023-02-15 22:12:52,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:52,211 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 381 transitions. [2023-02-15 22:12:52,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:52,211 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 381 transitions. [2023-02-15 22:12:52,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 22:12:52,211 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:52,211 INFO L195 NwaCegarLoop]: trace histogram [3, 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 22:12:52,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-02-15 22:12:52,212 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:12:52,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:52,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1832676911, now seen corresponding path program 2 times [2023-02-15 22:12:52,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:52,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689197343] [2023-02-15 22:12:52,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:52,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:52,682 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:12:52,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:52,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689197343] [2023-02-15 22:12:52,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689197343] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:12:52,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564567814] [2023-02-15 22:12:52,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:12:52,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:12:52,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:12:52,685 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 22:12:52,708 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 22:12:52,838 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 22:12:52,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:12:52,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-15 22:12:52,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:12:52,848 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 22:12:52,872 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:12:52,873 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 22:12:52,892 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:12:52,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-15 22:12:52,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 13 treesize of output 9 [2023-02-15 22:12:53,102 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:12:53,102 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2023-02-15 22:12:53,120 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:12:53,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:12:53,348 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 14 [2023-02-15 22:12:53,352 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 24 treesize of output 20 [2023-02-15 22:12:53,525 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:12:53,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564567814] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:12:53,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:12:53,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 23 [2023-02-15 22:12:53,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876234900] [2023-02-15 22:12:53,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:12:53,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-15 22:12:53,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:53,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-15 22:12:53,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2023-02-15 22:12:53,528 INFO L87 Difference]: Start difference. First operand 342 states and 381 transitions. Second operand has 24 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 24 states have internal predecessors, (107), 0 states have call successors, (0), 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 22:12:55,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:55,030 INFO L93 Difference]: Finished difference Result 676 states and 749 transitions. [2023-02-15 22:12:55,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 22:12:55,031 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 24 states have internal predecessors, (107), 0 states have call successors, (0), 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 22:12:55,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:55,033 INFO L225 Difference]: With dead ends: 676 [2023-02-15 22:12:55,034 INFO L226 Difference]: Without dead ends: 676 [2023-02-15 22:12:55,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 77 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=324, Invalid=1236, Unknown=0, NotChecked=0, Total=1560 [2023-02-15 22:12:55,035 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 2696 mSDsluCounter, 1934 mSDsCounter, 0 mSdLazyCounter, 2092 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2698 SdHoareTripleChecker+Valid, 2152 SdHoareTripleChecker+Invalid, 2188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:55,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2698 Valid, 2152 Invalid, 2188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2092 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-15 22:12:55,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2023-02-15 22:12:55,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 344. [2023-02-15 22:12:55,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 248 states have (on average 1.4919354838709677) internal successors, (370), 341 states have internal predecessors, (370), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:12:55,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 384 transitions. [2023-02-15 22:12:55,043 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 384 transitions. Word has length 46 [2023-02-15 22:12:55,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:55,043 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 384 transitions. [2023-02-15 22:12:55,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 24 states have internal predecessors, (107), 0 states have call successors, (0), 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 22:12:55,043 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 384 transitions. [2023-02-15 22:12:55,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 22:12:55,044 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:55,044 INFO L195 NwaCegarLoop]: trace histogram [3, 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 22:12:55,055 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 22:12:55,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:12:55,250 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:12:55,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:55,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1832676912, now seen corresponding path program 1 times [2023-02-15 22:12:55,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:55,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876215826] [2023-02-15 22:12:55,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:55,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:55,867 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:12:55,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:55,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876215826] [2023-02-15 22:12:55,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876215826] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:12:55,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305341436] [2023-02-15 22:12:55,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:55,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:12:55,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:12:55,873 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 22:12:55,876 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 22:12:56,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:56,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-15 22:12:56,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:12:56,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 22:12:56,024 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 22:12:56,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:12:56,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:12:56,081 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:12:56,082 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 22:12:56,104 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:12:56,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-15 22:12:56,150 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 22:12:56,154 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 22:12:56,427 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:12:56,428 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2023-02-15 22:12:56,434 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:12:56,435 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2023-02-15 22:12:56,503 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:12:56,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:12:56,915 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 14 [2023-02-15 22:12:56,917 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 24 treesize of output 20 [2023-02-15 22:12:56,938 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 29 treesize of output 27 [2023-02-15 22:12:56,942 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 27 treesize of output 25 [2023-02-15 22:12:56,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:12:56,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:12:57,280 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:12:57,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305341436] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:12:57,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:12:57,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 33 [2023-02-15 22:12:57,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065516433] [2023-02-15 22:12:57,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:12:57,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-15 22:12:57,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:57,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-15 22:12:57,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1016, Unknown=0, NotChecked=0, Total=1122 [2023-02-15 22:12:57,283 INFO L87 Difference]: Start difference. First operand 344 states and 384 transitions. Second operand has 34 states, 33 states have (on average 3.6666666666666665) internal successors, (121), 34 states have internal predecessors, (121), 0 states have call successors, (0), 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 22:13:00,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:00,269 INFO L93 Difference]: Finished difference Result 943 states and 1036 transitions. [2023-02-15 22:13:00,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-15 22:13:00,270 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.6666666666666665) internal successors, (121), 34 states have internal predecessors, (121), 0 states have call successors, (0), 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 22:13:00,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:00,272 INFO L225 Difference]: With dead ends: 943 [2023-02-15 22:13:00,272 INFO L226 Difference]: Without dead ends: 943 [2023-02-15 22:13:00,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=786, Invalid=2996, Unknown=0, NotChecked=0, Total=3782 [2023-02-15 22:13:00,274 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 5471 mSDsluCounter, 2011 mSDsCounter, 0 mSdLazyCounter, 2780 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5473 SdHoareTripleChecker+Valid, 2199 SdHoareTripleChecker+Invalid, 2896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:00,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5473 Valid, 2199 Invalid, 2896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2780 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-02-15 22:13:00,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2023-02-15 22:13:00,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 360. [2023-02-15 22:13:00,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 267 states have (on average 1.4606741573033708) internal successors, (390), 357 states have internal predecessors, (390), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:13:00,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 404 transitions. [2023-02-15 22:13:00,282 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 404 transitions. Word has length 46 [2023-02-15 22:13:00,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:00,282 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 404 transitions. [2023-02-15 22:13:00,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.6666666666666665) internal successors, (121), 34 states have internal predecessors, (121), 0 states have call successors, (0), 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 22:13:00,283 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 404 transitions. [2023-02-15 22:13:00,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 22:13:00,283 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:00,283 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] [2023-02-15 22:13:00,292 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 22:13:00,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-02-15 22:13:00,489 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:13:00,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:00,491 INFO L85 PathProgramCache]: Analyzing trace with hash -56370646, now seen corresponding path program 1 times [2023-02-15 22:13:00,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:00,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593011226] [2023-02-15 22:13:00,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:00,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:00,622 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 22:13:00,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:00,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593011226] [2023-02-15 22:13:00,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593011226] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:13:00,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:13:00,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 22:13:00,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344500586] [2023-02-15 22:13:00,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:13:00,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:13:00,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:00,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:13:00,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:13:00,624 INFO L87 Difference]: Start difference. First operand 360 states and 404 transitions. Second operand has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:13:00,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:00,979 INFO L93 Difference]: Finished difference Result 492 states and 546 transitions. [2023-02-15 22:13:00,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:13:00,980 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2023-02-15 22:13:00,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:00,981 INFO L225 Difference]: With dead ends: 492 [2023-02-15 22:13:00,981 INFO L226 Difference]: Without dead ends: 492 [2023-02-15 22:13:00,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-02-15 22:13:00,982 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 275 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:00,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 1193 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:13:00,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2023-02-15 22:13:01,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 363. [2023-02-15 22:13:01,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 272 states have (on average 1.4411764705882353) internal successors, (392), 360 states have internal predecessors, (392), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:13:01,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 406 transitions. [2023-02-15 22:13:01,003 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 406 transitions. Word has length 48 [2023-02-15 22:13:01,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:01,003 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 406 transitions. [2023-02-15 22:13:01,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:13:01,003 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 406 transitions. [2023-02-15 22:13:01,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 22:13:01,008 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:01,008 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] [2023-02-15 22:13:01,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-02-15 22:13:01,008 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:13:01,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:01,008 INFO L85 PathProgramCache]: Analyzing trace with hash -56370645, now seen corresponding path program 1 times [2023-02-15 22:13:01,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:01,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128058074] [2023-02-15 22:13:01,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:01,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:01,282 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 22:13:01,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:01,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128058074] [2023-02-15 22:13:01,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128058074] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:13:01,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:13:01,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 22:13:01,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326908753] [2023-02-15 22:13:01,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:13:01,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 22:13:01,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:01,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 22:13:01,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:13:01,285 INFO L87 Difference]: Start difference. First operand 363 states and 406 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 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 22:13:01,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:01,928 INFO L93 Difference]: Finished difference Result 469 states and 512 transitions. [2023-02-15 22:13:01,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 22:13:01,929 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 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 48 [2023-02-15 22:13:01,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:01,930 INFO L225 Difference]: With dead ends: 469 [2023-02-15 22:13:01,930 INFO L226 Difference]: Without dead ends: 469 [2023-02-15 22:13:01,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2023-02-15 22:13:01,931 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 987 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 1410 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:01,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 1410 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:13:01,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2023-02-15 22:13:01,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 366. [2023-02-15 22:13:01,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 275 states have (on average 1.4363636363636363) internal successors, (395), 363 states have internal predecessors, (395), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:13:01,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 409 transitions. [2023-02-15 22:13:01,937 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 409 transitions. Word has length 48 [2023-02-15 22:13:01,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:01,937 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 409 transitions. [2023-02-15 22:13:01,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 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 22:13:01,937 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 409 transitions. [2023-02-15 22:13:01,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-15 22:13:01,938 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:01,938 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1] [2023-02-15 22:13:01,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-02-15 22:13:01,938 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:13:01,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:01,939 INFO L85 PathProgramCache]: Analyzing trace with hash -2146523909, now seen corresponding path program 1 times [2023-02-15 22:13:01,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:01,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863105100] [2023-02-15 22:13:01,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:01,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:02,414 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 22:13:02,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:02,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863105100] [2023-02-15 22:13:02,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863105100] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:13:02,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853581972] [2023-02-15 22:13:02,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:02,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:13:02,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:13:02,415 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 22:13:02,417 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 22:13:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:02,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 22:13:02,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:13:02,648 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 31 treesize of output 19 [2023-02-15 22:13:02,651 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 22:13:02,680 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-15 22:13:02,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:13:02,773 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-15 22:13:02,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853581972] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:13:02,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:13:02,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 19 [2023-02-15 22:13:02,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101370232] [2023-02-15 22:13:02,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:13:02,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 22:13:02,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:02,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 22:13:02,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2023-02-15 22:13:02,774 INFO L87 Difference]: Start difference. First operand 366 states and 409 transitions. Second operand has 19 states, 19 states have (on average 4.526315789473684) internal successors, (86), 19 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:13:03,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:03,236 INFO L93 Difference]: Finished difference Result 364 states and 403 transitions. [2023-02-15 22:13:03,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:13:03,237 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.526315789473684) internal successors, (86), 19 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 22:13:03,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:03,238 INFO L225 Difference]: With dead ends: 364 [2023-02-15 22:13:03,238 INFO L226 Difference]: Without dead ends: 364 [2023-02-15 22:13:03,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2023-02-15 22:13:03,239 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 1078 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:03,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1078 Valid, 802 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:13:03,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2023-02-15 22:13:03,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2023-02-15 22:13:03,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 275 states have (on average 1.4218181818181819) internal successors, (391), 361 states have internal predecessors, (391), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:13:03,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 403 transitions. [2023-02-15 22:13:03,244 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 403 transitions. Word has length 50 [2023-02-15 22:13:03,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:03,244 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 403 transitions. [2023-02-15 22:13:03,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.526315789473684) internal successors, (86), 19 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:13:03,245 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 403 transitions. [2023-02-15 22:13:03,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 22:13:03,245 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:03,245 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:13:03,257 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 22:13:03,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:13:03,452 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:13:03,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:03,452 INFO L85 PathProgramCache]: Analyzing trace with hash -755050628, now seen corresponding path program 1 times [2023-02-15 22:13:03,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:03,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076161398] [2023-02-15 22:13:03,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:03,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:03,555 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 22:13:03,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:03,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076161398] [2023-02-15 22:13:03,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076161398] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:13:03,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:13:03,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:13:03,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871472471] [2023-02-15 22:13:03,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:13:03,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:13:03,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:03,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:13:03,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:13:03,559 INFO L87 Difference]: Start difference. First operand 364 states and 403 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:13:03,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:03,656 INFO L93 Difference]: Finished difference Result 363 states and 400 transitions. [2023-02-15 22:13:03,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:13:03,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2023-02-15 22:13:03,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:03,658 INFO L225 Difference]: With dead ends: 363 [2023-02-15 22:13:03,658 INFO L226 Difference]: Without dead ends: 363 [2023-02-15 22:13:03,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:13:03,659 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 27 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:03,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 823 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:13:03,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2023-02-15 22:13:03,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2023-02-15 22:13:03,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 275 states have (on average 1.4145454545454546) internal successors, (389), 360 states have internal predecessors, (389), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:13:03,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 400 transitions. [2023-02-15 22:13:03,664 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 400 transitions. Word has length 53 [2023-02-15 22:13:03,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:03,664 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 400 transitions. [2023-02-15 22:13:03,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:13:03,664 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 400 transitions. [2023-02-15 22:13:03,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 22:13:03,666 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:03,666 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:13:03,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-02-15 22:13:03,667 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:13:03,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:03,667 INFO L85 PathProgramCache]: Analyzing trace with hash -162853312, now seen corresponding path program 1 times [2023-02-15 22:13:03,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:03,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19424937] [2023-02-15 22:13:03,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:03,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:03,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 22:13:03,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:03,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19424937] [2023-02-15 22:13:03,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19424937] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:13:03,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:13:03,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 22:13:03,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401916718] [2023-02-15 22:13:03,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:13:03,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:13:03,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:03,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:13:03,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:13:03,931 INFO L87 Difference]: Start difference. First operand 363 states and 400 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 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 22:13:04,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:04,275 INFO L93 Difference]: Finished difference Result 480 states and 526 transitions. [2023-02-15 22:13:04,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:13:04,275 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 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 22:13:04,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:04,277 INFO L225 Difference]: With dead ends: 480 [2023-02-15 22:13:04,277 INFO L226 Difference]: Without dead ends: 480 [2023-02-15 22:13:04,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2023-02-15 22:13:04,277 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 268 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:04,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1754 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:13:04,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2023-02-15 22:13:04,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 362. [2023-02-15 22:13:04,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 274 states have (on average 1.4124087591240877) internal successors, (387), 359 states have internal predecessors, (387), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:13:04,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 398 transitions. [2023-02-15 22:13:04,283 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 398 transitions. Word has length 52 [2023-02-15 22:13:04,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:04,284 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 398 transitions. [2023-02-15 22:13:04,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 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 22:13:04,284 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 398 transitions. [2023-02-15 22:13:04,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 22:13:04,284 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:04,285 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:13:04,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-02-15 22:13:04,285 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:13:04,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:04,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1077445880, now seen corresponding path program 2 times [2023-02-15 22:13:04,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:04,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683870320] [2023-02-15 22:13:04,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:04,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:04,713 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:04,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:04,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683870320] [2023-02-15 22:13:04,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683870320] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:13:04,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610654979] [2023-02-15 22:13:04,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:13:04,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:13:04,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:13:04,715 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 22:13:04,716 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 22:13:04,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-15 22:13:04,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:13:04,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-15 22:13:04,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:13:04,968 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 22:13:04,972 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 22:13:04,974 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-15 22:13:04,974 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:13:04,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610654979] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:13:04,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:13:04,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 17 [2023-02-15 22:13:04,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66764291] [2023-02-15 22:13:04,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:13:04,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:13:04,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:04,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:13:04,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2023-02-15 22:13:04,976 INFO L87 Difference]: Start difference. First operand 362 states and 398 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:13:05,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:05,218 INFO L93 Difference]: Finished difference Result 479 states and 524 transitions. [2023-02-15 22:13:05,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:13:05,218 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2023-02-15 22:13:05,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:05,219 INFO L225 Difference]: With dead ends: 479 [2023-02-15 22:13:05,220 INFO L226 Difference]: Without dead ends: 479 [2023-02-15 22:13:05,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2023-02-15 22:13:05,220 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 255 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:05,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1201 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:13:05,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2023-02-15 22:13:05,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 357. [2023-02-15 22:13:05,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 269 states have (on average 1.41635687732342) internal successors, (381), 354 states have internal predecessors, (381), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:13:05,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 392 transitions. [2023-02-15 22:13:05,226 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 392 transitions. Word has length 53 [2023-02-15 22:13:05,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:05,226 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 392 transitions. [2023-02-15 22:13:05,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:13:05,226 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 392 transitions. [2023-02-15 22:13:05,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 22:13:05,227 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:05,227 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1] [2023-02-15 22:13:05,240 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 22:13:05,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:13:05,433 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:13:05,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:05,434 INFO L85 PathProgramCache]: Analyzing trace with hash 914566065, now seen corresponding path program 2 times [2023-02-15 22:13:05,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:05,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756589517] [2023-02-15 22:13:05,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:05,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:05,788 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 22:13:05,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:05,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756589517] [2023-02-15 22:13:05,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756589517] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:13:05,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509365118] [2023-02-15 22:13:05,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:13:05,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:13:05,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:13:05,793 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 22:13:05,803 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 22:13:05,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-15 22:13:05,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:13:05,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-15 22:13:05,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:13:06,023 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 22:13:06,028 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 22:13:06,039 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-15 22:13:06,039 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:13:06,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509365118] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:13:06,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:13:06,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2023-02-15 22:13:06,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976210125] [2023-02-15 22:13:06,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:13:06,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:13:06,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:06,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:13:06,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-02-15 22:13:06,041 INFO L87 Difference]: Start difference. First operand 357 states and 392 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:13:06,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:06,196 INFO L93 Difference]: Finished difference Result 380 states and 414 transitions. [2023-02-15 22:13:06,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:13:06,196 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2023-02-15 22:13:06,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:06,197 INFO L225 Difference]: With dead ends: 380 [2023-02-15 22:13:06,197 INFO L226 Difference]: Without dead ends: 380 [2023-02-15 22:13:06,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2023-02-15 22:13:06,198 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 109 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:06,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 994 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:13:06,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2023-02-15 22:13:06,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 342. [2023-02-15 22:13:06,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 254 states have (on average 1.437007874015748) internal successors, (365), 339 states have internal predecessors, (365), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:13:06,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 376 transitions. [2023-02-15 22:13:06,203 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 376 transitions. Word has length 52 [2023-02-15 22:13:06,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:06,203 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 376 transitions. [2023-02-15 22:13:06,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:13:06,203 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 376 transitions. [2023-02-15 22:13:06,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-15 22:13:06,204 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:06,204 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:13:06,215 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 22:13:06,410 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,SelfDestructingSolverStorable39 [2023-02-15 22:13:06,410 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:13:06,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:06,410 INFO L85 PathProgramCache]: Analyzing trace with hash 874630922, now seen corresponding path program 1 times [2023-02-15 22:13:06,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:06,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058507887] [2023-02-15 22:13:06,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:06,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:07,402 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:07,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:07,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058507887] [2023-02-15 22:13:07,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058507887] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:13:07,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947430335] [2023-02-15 22:13:07,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:07,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:13:07,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:13:07,405 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 22:13:07,431 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 22:13:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:07,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 68 conjunts are in the unsatisfiable core [2023-02-15 22:13:07,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:13:07,616 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 22:13:07,643 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 22:13:07,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:13:07,655 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 22 treesize of output 21 [2023-02-15 22:13:07,683 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:13:07,683 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 22:13:07,728 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 15 treesize of output 17 [2023-02-15 22:13:07,744 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 15 treesize of output 17 [2023-02-15 22:13:07,753 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 22:13:07,761 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:13:07,761 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 22:13:07,810 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 15 treesize of output 17 [2023-02-15 22:13:07,845 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 13 treesize of output 9 [2023-02-15 22:13:07,850 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 22 treesize of output 21 [2023-02-15 22:13:08,023 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 13 treesize of output 9 [2023-02-15 22:13:08,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 22:13:08,303 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:13:08,303 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 15 [2023-02-15 22:13:08,306 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:08,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:13:08,613 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:13:08,614 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 16 treesize of output 20 [2023-02-15 22:13:08,685 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_22| Int) (v_arrayElimArr_1 (Array Int Int))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_22|))) (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~data~0#1.base|)) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_22| v_arrayElimArr_1) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|))))) is different from false [2023-02-15 22:13:08,958 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:13:08,959 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 22 treesize of output 23 [2023-02-15 22:13:08,964 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 65 treesize of output 57 [2023-02-15 22:13:08,972 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:13:08,972 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 59 treesize of output 61 [2023-02-15 22:13:08,977 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 22:13:09,235 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-02-15 22:13:09,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947430335] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:13:09,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:13:09,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 18] total 42 [2023-02-15 22:13:09,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209854849] [2023-02-15 22:13:09,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:13:09,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-02-15 22:13:09,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:09,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-02-15 22:13:09,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1509, Unknown=3, NotChecked=78, Total=1722 [2023-02-15 22:13:09,238 INFO L87 Difference]: Start difference. First operand 342 states and 376 transitions. Second operand has 42 states, 42 states have (on average 3.2857142857142856) internal successors, (138), 42 states have internal predecessors, (138), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:13:12,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:12,923 INFO L93 Difference]: Finished difference Result 634 states and 684 transitions. [2023-02-15 22:13:12,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-15 22:13:12,926 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.2857142857142856) internal successors, (138), 42 states have internal predecessors, (138), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2023-02-15 22:13:12,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:12,928 INFO L225 Difference]: With dead ends: 634 [2023-02-15 22:13:12,928 INFO L226 Difference]: Without dead ends: 634 [2023-02-15 22:13:12,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 88 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=729, Invalid=3562, Unknown=3, NotChecked=128, Total=4422 [2023-02-15 22:13:12,929 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 4355 mSDsluCounter, 4240 mSDsCounter, 0 mSdLazyCounter, 3713 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4357 SdHoareTripleChecker+Valid, 4479 SdHoareTripleChecker+Invalid, 4212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 3713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 439 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:12,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4357 Valid, 4479 Invalid, 4212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 3713 Invalid, 0 Unknown, 439 Unchecked, 1.9s Time] [2023-02-15 22:13:12,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2023-02-15 22:13:12,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 342. [2023-02-15 22:13:12,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 254 states have (on average 1.4330708661417322) internal successors, (364), 339 states have internal predecessors, (364), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:13:12,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 375 transitions. [2023-02-15 22:13:12,944 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 375 transitions. Word has length 56 [2023-02-15 22:13:12,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:12,944 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 375 transitions. [2023-02-15 22:13:12,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.2857142857142856) internal successors, (138), 42 states have internal predecessors, (138), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:13:12,944 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 375 transitions. [2023-02-15 22:13:12,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-15 22:13:12,945 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:12,945 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 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] [2023-02-15 22:13:12,966 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 22:13:13,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:13:13,152 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:13:13,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:13,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1551686691, now seen corresponding path program 1 times [2023-02-15 22:13:13,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:13,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223669562] [2023-02-15 22:13:13,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:13,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:14,089 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:14,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:14,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223669562] [2023-02-15 22:13:14,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223669562] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:13:14,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239289063] [2023-02-15 22:13:14,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:14,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:13:14,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:13:14,092 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 22:13:14,094 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 22:13:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:14,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 72 conjunts are in the unsatisfiable core [2023-02-15 22:13:14,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:13:14,300 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 22:13:14,343 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 13 treesize of output 9 [2023-02-15 22:13:14,346 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 13 treesize of output 9 [2023-02-15 22:13:14,436 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:13:14,436 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 22:13:14,481 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 16 treesize of output 18 [2023-02-15 22:13:14,488 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 16 treesize of output 18 [2023-02-15 22:13:14,510 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 16 treesize of output 18 [2023-02-15 22:13:14,515 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 16 treesize of output 18 [2023-02-15 22:13:14,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 22:13:14,539 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:13:14,539 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 22:13:14,591 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 16 treesize of output 18 [2023-02-15 22:13:14,598 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 16 treesize of output 18 [2023-02-15 22:13:14,611 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 19 treesize of output 18 [2023-02-15 22:13:14,616 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 23 treesize of output 22 [2023-02-15 22:13:14,788 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 13 treesize of output 9 [2023-02-15 22:13:15,138 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:13:15,139 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:13:15,145 INFO L321 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2023-02-15 22:13:15,146 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 5 case distinctions, treesize of input 61 treesize of output 36 [2023-02-15 22:13:15,152 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:13:15,156 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 22:13:15,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 16 [2023-02-15 22:13:15,196 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:15,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:13:19,540 INFO L321 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2023-02-15 22:13:19,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 91 [2023-02-15 22:13:19,545 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 86 treesize of output 78 [2023-02-15 22:13:19,679 INFO L321 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2023-02-15 22:13:19,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 73 [2023-02-15 22:13:19,686 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 108 treesize of output 96 [2023-02-15 22:13:22,372 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:13:22,372 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 25 treesize of output 26 [2023-02-15 22:13:22,376 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 140 treesize of output 122 [2023-02-15 22:13:22,392 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:13:22,393 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 124 treesize of output 114 [2023-02-15 22:13:22,397 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 102 treesize of output 94 [2023-02-15 22:13:22,491 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:13:22,491 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 53 treesize of output 43 [2023-02-15 22:13:22,502 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:13:22,502 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 301 treesize of output 275 [2023-02-15 22:13:22,525 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:13:22,525 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 263 treesize of output 255 [2023-02-15 22:13:22,548 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:13:22,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 253 treesize of output 215 [2023-02-15 22:13:23,044 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:23,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239289063] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:13:23,045 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:13:23,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 19] total 50 [2023-02-15 22:13:23,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365251027] [2023-02-15 22:13:23,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:13:23,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-15 22:13:23,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:23,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-15 22:13:23,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=2310, Unknown=11, NotChecked=0, Total=2450 [2023-02-15 22:13:23,049 INFO L87 Difference]: Start difference. First operand 342 states and 375 transitions. Second operand has 50 states, 50 states have (on average 3.06) internal successors, (153), 50 states have internal predecessors, (153), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:13:30,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:30,065 INFO L93 Difference]: Finished difference Result 690 states and 733 transitions. [2023-02-15 22:13:30,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-02-15 22:13:30,065 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.06) internal successors, (153), 50 states have internal predecessors, (153), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2023-02-15 22:13:30,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:30,067 INFO L225 Difference]: With dead ends: 690 [2023-02-15 22:13:30,068 INFO L226 Difference]: Without dead ends: 690 [2023-02-15 22:13:30,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1291 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=851, Invalid=7148, Unknown=11, NotChecked=0, Total=8010 [2023-02-15 22:13:30,070 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 5008 mSDsluCounter, 6456 mSDsCounter, 0 mSdLazyCounter, 4553 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5010 SdHoareTripleChecker+Valid, 6715 SdHoareTripleChecker+Invalid, 4641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 4553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:30,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5010 Valid, 6715 Invalid, 4641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 4553 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-02-15 22:13:30,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2023-02-15 22:13:30,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 374. [2023-02-15 22:13:30,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 286 states have (on average 1.3881118881118881) internal successors, (397), 371 states have internal predecessors, (397), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:13:30,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 408 transitions. [2023-02-15 22:13:30,076 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 408 transitions. Word has length 56 [2023-02-15 22:13:30,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:30,076 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 408 transitions. [2023-02-15 22:13:30,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.06) internal successors, (153), 50 states have internal predecessors, (153), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:13:30,076 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 408 transitions. [2023-02-15 22:13:30,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-15 22:13:30,077 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:30,077 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:13:30,083 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 22:13:30,283 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,SelfDestructingSolverStorable41 [2023-02-15 22:13:30,284 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:13:30,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:30,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1125924296, now seen corresponding path program 1 times [2023-02-15 22:13:30,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:30,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127172008] [2023-02-15 22:13:30,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:30,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:30,346 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 22:13:30,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:30,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127172008] [2023-02-15 22:13:30,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127172008] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:13:30,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:13:30,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:13:30,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713453789] [2023-02-15 22:13:30,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:13:30,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:13:30,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:30,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:13:30,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:13:30,349 INFO L87 Difference]: Start difference. First operand 374 states and 408 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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 22:13:30,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:30,423 INFO L93 Difference]: Finished difference Result 462 states and 501 transitions. [2023-02-15 22:13:30,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:13:30,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2023-02-15 22:13:30,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:30,425 INFO L225 Difference]: With dead ends: 462 [2023-02-15 22:13:30,426 INFO L226 Difference]: Without dead ends: 462 [2023-02-15 22:13:30,426 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 22:13:30,427 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 464 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:30,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 413 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:13:30,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2023-02-15 22:13:30,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 375. [2023-02-15 22:13:30,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 287 states have (on average 1.386759581881533) internal successors, (398), 372 states have internal predecessors, (398), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:13:30,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 409 transitions. [2023-02-15 22:13:30,433 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 409 transitions. Word has length 57 [2023-02-15 22:13:30,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:30,435 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 409 transitions. [2023-02-15 22:13:30,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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 22:13:30,435 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 409 transitions. [2023-02-15 22:13:30,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-15 22:13:30,435 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:30,436 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:13:30,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-02-15 22:13:30,436 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:13:30,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:30,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1343539666, now seen corresponding path program 1 times [2023-02-15 22:13:30,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:30,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831417510] [2023-02-15 22:13:30,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:30,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:31,507 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:31,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:31,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831417510] [2023-02-15 22:13:31,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831417510] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:13:31,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826022661] [2023-02-15 22:13:31,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:31,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:13:31,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:13:31,509 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 22:13:31,512 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 22:13:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:31,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 85 conjunts are in the unsatisfiable core [2023-02-15 22:13:31,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:13:31,695 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 22:13:31,727 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:13:31,728 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 22:13:31,781 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 22:13:31,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:13:31,820 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 31 treesize of output 26 [2023-02-15 22:13:31,891 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-02-15 22:13:31,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2023-02-15 22:13:31,955 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 32 treesize of output 30 [2023-02-15 22:13:32,004 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 32 treesize of output 30 [2023-02-15 22:13:32,065 INFO L321 Elim1Store]: treesize reduction 66, result has 35.3 percent of original size [2023-02-15 22:13:32,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 53 [2023-02-15 22:13:32,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 22:13:32,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2023-02-15 22:13:32,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:13:32,269 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:13:32,269 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 54 [2023-02-15 22:13:32,284 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 13 treesize of output 9 [2023-02-15 22:13:32,569 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 13 treesize of output 9 [2023-02-15 22:13:32,891 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 22:13:33,283 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:13:33,284 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 2 case distinctions, treesize of input 107 treesize of output 46 [2023-02-15 22:13:33,347 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:33,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:13:33,787 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1894 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_27| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_27|))) (= (select (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_27| 1) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_1894))) (store .cse0 |v_ULTIMATE.start_main_~item~0#1.base_27| (store (store (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_27|) 0 |c_ULTIMATE.start_main_~node~1#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|)) 1))) is different from false [2023-02-15 22:13:34,145 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:13:34,146 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 2 case distinctions, treesize of input 58 treesize of output 51 [2023-02-15 22:13:34,148 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:13:34,154 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:13:34,154 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 218 treesize of output 212 [2023-02-15 22:13:34,159 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 198 treesize of output 194 [2023-02-15 22:13:34,168 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 25 treesize of output 21 [2023-02-15 22:13:34,190 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 321 treesize of output 313 [2023-02-15 22:13:35,018 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-02-15 22:13:35,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826022661] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:13:35,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:13:35,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 18] total 48 [2023-02-15 22:13:35,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834801516] [2023-02-15 22:13:35,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:13:35,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-02-15 22:13:35,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:35,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-02-15 22:13:35,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2052, Unknown=5, NotChecked=92, Total=2352 [2023-02-15 22:13:35,021 INFO L87 Difference]: Start difference. First operand 375 states and 409 transitions. Second operand has 49 states, 48 states have (on average 3.1666666666666665) internal successors, (152), 49 states have internal predecessors, (152), 0 states have call successors, (0), 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 22:14:26,056 WARN L233 SmtUtils]: Spent 12.35s on a formula simplification. DAG size of input: 100 DAG size of output: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:14:28,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:14:28,212 INFO L93 Difference]: Finished difference Result 630 states and 681 transitions. [2023-02-15 22:14:28,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 22:14:28,213 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 3.1666666666666665) internal successors, (152), 49 states have internal predecessors, (152), 0 states have call successors, (0), 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 57 [2023-02-15 22:14:28,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:14:28,214 INFO L225 Difference]: With dead ends: 630 [2023-02-15 22:14:28,214 INFO L226 Difference]: Without dead ends: 630 [2023-02-15 22:14:28,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 84 SyntacticMatches, 6 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1036 ImplicationChecksByTransitivity, 52.5s TimeCoverageRelationStatistics Valid=920, Invalid=4043, Unknown=11, NotChecked=138, Total=5112 [2023-02-15 22:14:28,215 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 3660 mSDsluCounter, 3854 mSDsCounter, 0 mSdLazyCounter, 4297 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3662 SdHoareTripleChecker+Valid, 4076 SdHoareTripleChecker+Invalid, 4825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 4297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 415 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:14:28,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3662 Valid, 4076 Invalid, 4825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 4297 Invalid, 0 Unknown, 415 Unchecked, 2.7s Time] [2023-02-15 22:14:28,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2023-02-15 22:14:28,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 376. [2023-02-15 22:14:28,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 288 states have (on average 1.3888888888888888) internal successors, (400), 373 states have internal predecessors, (400), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:14:28,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 411 transitions. [2023-02-15 22:14:28,221 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 411 transitions. Word has length 57 [2023-02-15 22:14:28,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:14:28,221 INFO L495 AbstractCegarLoop]: Abstraction has 376 states and 411 transitions. [2023-02-15 22:14:28,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 3.1666666666666665) internal successors, (152), 49 states have internal predecessors, (152), 0 states have call successors, (0), 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 22:14:28,221 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 411 transitions. [2023-02-15 22:14:28,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-15 22:14:28,222 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:28,222 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:14:28,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 22:14:28,432 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,SelfDestructingSolverStorable43 [2023-02-15 22:14:28,432 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:14:28,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:28,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1343539667, now seen corresponding path program 1 times [2023-02-15 22:14:28,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:28,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613093488] [2023-02-15 22:14:28,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:28,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:30,046 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:30,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:30,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613093488] [2023-02-15 22:14:30,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613093488] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:14:30,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539184781] [2023-02-15 22:14:30,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:30,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:14:30,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:14:30,048 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 22:14:30,077 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 22:14:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:30,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 85 conjunts are in the unsatisfiable core [2023-02-15 22:14:30,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:14:30,229 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 22:14:30,232 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 22:14:30,286 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:14:30,286 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 22:14:30,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:14:30,332 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 22:14:30,340 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 22:14:30,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:30,376 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 40 treesize of output 31 [2023-02-15 22:14:30,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:30,384 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 22:14:30,445 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 22:14:30,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2023-02-15 22:14:30,474 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-02-15 22:14:30,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2023-02-15 22:14:30,542 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 41 treesize of output 37 [2023-02-15 22:14:30,556 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 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 22:14:30,609 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 41 treesize of output 37 [2023-02-15 22:14:30,617 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 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 22:14:30,673 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 22:14:30,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2023-02-15 22:14:30,706 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-15 22:14:30,707 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 20 treesize of output 22 [2023-02-15 22:14:30,775 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 22:14:30,779 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 32 treesize of output 30 [2023-02-15 22:14:30,797 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 37 treesize of output 28 [2023-02-15 22:14:30,800 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 23 treesize of output 22 [2023-02-15 22:14:31,690 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:14:31,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:31,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:31,693 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:14:31,696 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 22:14:31,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 99 treesize of output 50 [2023-02-15 22:14:31,705 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:14:31,709 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 22:14:31,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2023-02-15 22:14:31,759 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:31,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:14:32,596 INFO L321 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2023-02-15 22:14:32,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 69 [2023-02-15 22:14:32,600 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 78 treesize of output 70 [2023-02-15 22:14:32,717 INFO L321 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2023-02-15 22:14:32,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 119 [2023-02-15 22:14:32,739 INFO L321 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2023-02-15 22:14:32,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 150 treesize of output 135 [2023-02-15 22:14:37,114 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:14:37,120 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:14:37,120 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 2 case distinctions, treesize of input 59 treesize of output 65 [2023-02-15 22:14:37,125 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:14:37,130 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:14:37,130 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 2 case distinctions, treesize of input 46 treesize of output 52 [2023-02-15 22:14:37,137 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 140 treesize of output 132 [2023-02-15 22:14:37,145 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 862 treesize of output 826 [2023-02-15 22:14:37,174 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:14:37,175 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 828 treesize of output 802 [2023-02-15 22:14:37,191 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 790 treesize of output 774 [2023-02-15 22:14:37,209 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:14:37,210 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 780 treesize of output 754 [2023-02-15 22:14:37,228 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 378 treesize of output 362 [2023-02-15 22:14:39,884 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:14:39,890 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:14:39,891 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 2 case distinctions, treesize of input 26 treesize of output 32 [2023-02-15 22:14:39,897 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 60 treesize of output 52 [2023-02-15 22:14:39,906 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:14:39,907 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 54 treesize of output 56 [2023-02-15 22:14:39,912 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 22 treesize of output 20 [2023-02-15 22:14:47,775 WARN L233 SmtUtils]: Spent 5.81s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:14:47,887 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:14:47,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539184781] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:14:47,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:14:47,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 18] total 50 [2023-02-15 22:14:47,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089425752] [2023-02-15 22:14:47,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:14:47,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-02-15 22:14:47,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:47,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-02-15 22:14:47,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2393, Unknown=5, NotChecked=0, Total=2550 [2023-02-15 22:14:47,890 INFO L87 Difference]: Start difference. First operand 376 states and 411 transitions. Second operand has 51 states, 50 states have (on average 3.3) internal successors, (165), 51 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:15:04,108 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 22:15:12,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:15:12,462 INFO L93 Difference]: Finished difference Result 803 states and 863 transitions. [2023-02-15 22:15:12,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-02-15 22:15:12,462 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 3.3) internal successors, (165), 51 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2023-02-15 22:15:12,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:15:12,464 INFO L225 Difference]: With dead ends: 803 [2023-02-15 22:15:12,465 INFO L226 Difference]: Without dead ends: 803 [2023-02-15 22:15:12,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 28.9s TimeCoverageRelationStatistics Valid=1188, Invalid=5613, Unknown=5, NotChecked=0, Total=6806 [2023-02-15 22:15:12,466 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 6070 mSDsluCounter, 3761 mSDsCounter, 0 mSdLazyCounter, 5089 mSolverCounterSat, 133 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6070 SdHoareTripleChecker+Valid, 3966 SdHoareTripleChecker+Invalid, 5223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 5089 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:15:12,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6070 Valid, 3966 Invalid, 5223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 5089 Invalid, 1 Unknown, 0 Unchecked, 8.6s Time] [2023-02-15 22:15:12,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2023-02-15 22:15:12,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 376. [2023-02-15 22:15:12,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 288 states have (on average 1.3854166666666667) internal successors, (399), 373 states have internal predecessors, (399), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:15:12,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 410 transitions. [2023-02-15 22:15:12,472 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 410 transitions. Word has length 57 [2023-02-15 22:15:12,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:15:12,472 INFO L495 AbstractCegarLoop]: Abstraction has 376 states and 410 transitions. [2023-02-15 22:15:12,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 3.3) internal successors, (165), 51 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:15:12,472 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 410 transitions. [2023-02-15 22:15:12,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-15 22:15:12,473 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:15:12,473 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:15:12,484 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 22:15:12,679 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,SelfDestructingSolverStorable44 [2023-02-15 22:15:12,680 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, merge_single_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-02-15 22:15:12,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:15:12,680 INFO L85 PathProgramCache]: Analyzing trace with hash 590188247, now seen corresponding path program 1 times [2023-02-15 22:15:12,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:15:12,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194347320] [2023-02-15 22:15:12,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:15:12,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:15:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:15:14,691 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:15:14,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:15:14,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194347320] [2023-02-15 22:15:14,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194347320] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:15:14,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934676877] [2023-02-15 22:15:14,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:15:14,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:15:14,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:15:14,692 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 22:15:14,694 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 22:15:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:15:14,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 113 conjunts are in the unsatisfiable core [2023-02-15 22:15:14,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:15:14,876 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 22:15:14,910 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 22:15:14,915 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 22:15:14,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:15:14,932 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 22:15:14,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:15:14,937 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 22:15:14,964 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:15:14,964 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 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 22:15:15,032 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 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-15 22:15:15,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:15:15,040 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 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-15 22:15:15,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:15:15,094 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:15:15,095 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 42 [2023-02-15 22:15:15,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:15:15,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:15:15,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2023-02-15 22:15:15,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:15:15,217 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-02-15 22:15:15,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2023-02-15 22:15:15,308 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:15:15,309 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 48 [2023-02-15 22:15:15,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:15:15,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2023-02-15 22:15:15,400 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:15:15,400 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 48 [2023-02-15 22:15:15,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:15:15,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2023-02-15 22:15:15,479 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 22:15:15,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:15:15,498 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-15 22:15:15,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-02-15 22:15:15,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:15:15,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-02-15 22:15:15,594 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:15:15,594 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 41 [2023-02-15 22:15:15,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:15:15,664 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:15:15,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-02-15 22:15:15,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:15:15,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:15:15,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 56 [2023-02-15 22:15:15,987 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 13 treesize of output 9 [2023-02-15 22:15:17,086 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:15:17,109 INFO L321 Elim1Store]: treesize reduction 83, result has 15.3 percent of original size [2023-02-15 22:15:17,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 141 treesize of output 81 [2023-02-15 22:15:17,123 INFO L321 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2023-02-15 22:15:17,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 28 [2023-02-15 22:15:17,154 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:15:17,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:15:17,979 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:15:17,979 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 113 treesize of output 101 [2023-02-15 22:15:29,603 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~item~0#1.base_31| Int) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2167 Int) (|v_ULTIMATE.start_main_~node~1#1.base_29| Int) (v_ArrVal_2174 (Array Int Int)) (v_ArrVal_2173 (Array Int Int)) (v_ArrVal_2170 Int)) (let ((.cse3 (select v_arrayElimArr_14 4))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| .cse3 (store (store (select |c_#memory_$Pointer$.base| .cse3) 0 |c_ULTIMATE.start_main_~node~1#1.base|) 4 v_ArrVal_2167)) |v_ULTIMATE.start_main_~node~1#1.base_29| v_ArrVal_2174) |v_ULTIMATE.start_main_~item~0#1.base_31| v_arrayElimArr_14))) (let ((.cse4 (store |c_#valid| .cse3 1)) (.cse1 (select .cse0 .cse3))) (or (= (select (select .cse0 (select .cse1 0)) (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| .cse3 (store (store (select |c_#memory_$Pointer$.offset| .cse3) 0 |c_ULTIMATE.start_main_~node~1#1.offset|) 4 v_ArrVal_2166)) |v_ULTIMATE.start_main_~node~1#1.base_29| v_ArrVal_2173))) (store .cse2 |v_ULTIMATE.start_main_~item~0#1.base_31| (store (store (select .cse2 |v_ULTIMATE.start_main_~item~0#1.base_31|) 0 0) 4 0))) .cse3) 0)) 0) (not (= 0 (select |c_#valid| .cse3))) (= 0 .cse3) (not (= 0 (select .cse4 |v_ULTIMATE.start_main_~node~1#1.base_29|))) (not (= 0 (select (store .cse4 |v_ULTIMATE.start_main_~node~1#1.base_29| v_ArrVal_2170) |v_ULTIMATE.start_main_~item~0#1.base_31|))) (not (= (select .cse1 4) 0))))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_31| Int) (v_ArrVal_2166 Int) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2167 Int) (|v_ULTIMATE.start_main_~node~1#1.base_29| Int) (v_ArrVal_2174 (Array Int Int)) (v_ArrVal_2173 (Array Int Int)) (v_ArrVal_2170 Int)) (let ((.cse7 (select v_arrayElimArr_14 4))) (let ((.cse9 (store |c_#valid| .cse7 1)) (.cse6 (select (store (store (store |c_#memory_$Pointer$.base| .cse7 (store (store (select |c_#memory_$Pointer$.base| .cse7) 0 |c_ULTIMATE.start_main_~node~1#1.base|) 4 v_ArrVal_2167)) |v_ULTIMATE.start_main_~node~1#1.base_29| v_ArrVal_2174) |v_ULTIMATE.start_main_~item~0#1.base_31| v_arrayElimArr_14) .cse7))) (or (= (let ((.cse5 (let ((.cse8 (store (store |c_#memory_$Pointer$.offset| .cse7 (store (store (select |c_#memory_$Pointer$.offset| .cse7) 0 |c_ULTIMATE.start_main_~node~1#1.offset|) 4 v_ArrVal_2166)) |v_ULTIMATE.start_main_~node~1#1.base_29| v_ArrVal_2173))) (store .cse8 |v_ULTIMATE.start_main_~item~0#1.base_31| (store (store (select .cse8 |v_ULTIMATE.start_main_~item~0#1.base_31|) 0 0) 4 0))))) (select (select .cse5 (select .cse6 0)) (select (select .cse5 .cse7) 0))) 0) (not (= 0 (select |c_#valid| .cse7))) (= 0 .cse7) (not (= 0 (select .cse9 |v_ULTIMATE.start_main_~node~1#1.base_29|))) (not (= 0 (select (store .cse9 |v_ULTIMATE.start_main_~node~1#1.base_29| v_ArrVal_2170) |v_ULTIMATE.start_main_~item~0#1.base_31|))) (not (= (select .cse6 4) 0))))))) is different from false [2023-02-15 22:15:30,396 INFO L321 Elim1Store]: treesize reduction 132, result has 27.9 percent of original size [2023-02-15 22:15:30,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 264 treesize of output 151 [2023-02-15 22:15:30,402 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:15:30,448 INFO L321 Elim1Store]: treesize reduction 144, result has 21.3 percent of original size [2023-02-15 22:15:30,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 158 treesize of output 114 [2023-02-15 22:15:30,452 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:15:30,452 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:15:30,460 INFO L321 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2023-02-15 22:15:30,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 60 [2023-02-15 22:15:30,465 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:15:30,465 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:15:30,467 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:15:30,480 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:15:30,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 318 treesize of output 272 [2023-02-15 22:15:30,491 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 310 treesize of output 282 [2023-02-15 22:15:30,505 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 67 treesize of output 55 [2023-02-15 22:15:30,541 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 98 [2023-02-15 22:15:30,716 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2023-02-15 22:15:30,736 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-02-15 22:15:30,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 64 [2023-02-15 22:15:30,864 INFO L321 Elim1Store]: treesize reduction 120, result has 34.4 percent of original size [2023-02-15 22:15:30,865 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 4 case distinctions, treesize of input 270 treesize of output 209 [2023-02-15 22:15:30,931 INFO L321 Elim1Store]: treesize reduction 137, result has 25.1 percent of original size [2023-02-15 22:15:30,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 130 treesize of output 94 [2023-02-15 22:15:30,946 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:15:30,946 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:15:30,950 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:15:30,992 INFO L321 Elim1Store]: treesize reduction 172, result has 12.7 percent of original size [2023-02-15 22:15:30,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 456 treesize of output 312 [2023-02-15 22:15:31,001 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:15:31,002 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:15:31,011 INFO L321 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-02-15 22:15:31,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 303 treesize of output 215 [2023-02-15 22:15:31,022 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 98 treesize of output 90 [2023-02-15 22:15:31,031 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:15:31,031 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 289 treesize of output 263 [2023-02-15 22:15:31,851 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-02-15 22:15:31,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934676877] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:15:31,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:15:31,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 25] total 61 [2023-02-15 22:15:31,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072910458] [2023-02-15 22:15:31,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:15:31,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-02-15 22:15:31,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:15:31,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-02-15 22:15:31,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=3291, Unknown=16, NotChecked=116, Total=3660 [2023-02-15 22:15:31,855 INFO L87 Difference]: Start difference. First operand 376 states and 410 transitions. Second operand has 61 states, 61 states have (on average 2.639344262295082) internal successors, (161), 61 states have internal predecessors, (161), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:15:49,886 WARN L233 SmtUtils]: Spent 6.56s on a formula simplification. DAG size of input: 171 DAG size of output: 129 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:16:17,380 WARN L233 SmtUtils]: Spent 20.28s on a formula simplification. DAG size of input: 189 DAG size of output: 158 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:16:19,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]