./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7e1ff0e6 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/list-simple/sll2n_append_equal.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 f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-15 01:38:44,329 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 01:38:44,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 01:38:44,370 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 01:38:44,370 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 01:38:44,373 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 01:38:44,374 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 01:38:44,377 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 01:38:44,379 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 01:38:44,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 01:38:44,384 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 01:38:44,386 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 01:38:44,386 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 01:38:44,388 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 01:38:44,389 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 01:38:44,391 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 01:38:44,392 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 01:38:44,393 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 01:38:44,395 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 01:38:44,404 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 01:38:44,406 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 01:38:44,407 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 01:38:44,408 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 01:38:44,408 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 01:38:44,416 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 01:38:44,416 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 01:38:44,417 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 01:38:44,418 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 01:38:44,418 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 01:38:44,419 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 01:38:44,419 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 01:38:44,420 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 01:38:44,421 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 01:38:44,422 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 01:38:44,423 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 01:38:44,423 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 01:38:44,424 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 01:38:44,424 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 01:38:44,424 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 01:38:44,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 01:38:44,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 01:38:44,427 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 01:38:44,453 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 01:38:44,454 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 01:38:44,454 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 01:38:44,454 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 01:38:44,455 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 01:38:44,455 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 01:38:44,456 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 01:38:44,456 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 01:38:44,456 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 01:38:44,456 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 01:38:44,457 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 01:38:44,457 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 01:38:44,457 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 01:38:44,458 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 01:38:44,458 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 01:38:44,458 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 01:38:44,458 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 01:38:44,458 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 01:38:44,459 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 01:38:44,459 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 01:38:44,459 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 01:38:44,459 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 01:38:44,459 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 01:38:44,460 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 01:38:44,460 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 01:38:44,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:38:44,460 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 01:38:44,460 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 01:38:44,461 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 01:38:44,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 01:38:44,461 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 01:38:44,461 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 01:38:44,461 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 01:38:44,462 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 01:38:44,462 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 -> f218eac2d2b52810cb44bb8b3f3f80463ec7e46c8818b20f079ed947cc8e9fd0 [2023-02-15 01:38:44,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 01:38:44,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 01:38:44,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 01:38:44,697 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 01:38:44,697 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 01:38:44,698 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_append_equal.i [2023-02-15 01:38:45,788 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 01:38:46,079 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 01:38:46,079 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2023-02-15 01:38:46,098 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bf52899a/0e922ee04fe443a3968277f86738e890/FLAGec993e492 [2023-02-15 01:38:46,115 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bf52899a/0e922ee04fe443a3968277f86738e890 [2023-02-15 01:38:46,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 01:38:46,119 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 01:38:46,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 01:38:46,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 01:38:46,124 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 01:38:46,125 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:38:46" (1/1) ... [2023-02-15 01:38:46,126 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59ff7ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:38:46, skipping insertion in model container [2023-02-15 01:38:46,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:38:46" (1/1) ... [2023-02-15 01:38:46,133 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 01:38:46,174 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 01:38:46,406 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/list-simple/sll2n_append_equal.i[24197,24210] [2023-02-15 01:38:46,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:38:46,422 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 01:38:46,472 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/list-simple/sll2n_append_equal.i[24197,24210] [2023-02-15 01:38:46,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:38:46,509 INFO L208 MainTranslator]: Completed translation [2023-02-15 01:38:46,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:38:46 WrapperNode [2023-02-15 01:38:46,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 01:38:46,511 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 01:38:46,511 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 01:38:46,511 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 01:38:46,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:38:46" (1/1) ... [2023-02-15 01:38:46,534 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:38:46" (1/1) ... [2023-02-15 01:38:46,556 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 121 [2023-02-15 01:38:46,556 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 01:38:46,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 01:38:46,557 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 01:38:46,557 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 01:38:46,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:38:46" (1/1) ... [2023-02-15 01:38:46,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:38:46" (1/1) ... [2023-02-15 01:38:46,569 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:38:46" (1/1) ... [2023-02-15 01:38:46,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:38:46" (1/1) ... [2023-02-15 01:38:46,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:38:46" (1/1) ... [2023-02-15 01:38:46,578 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:38:46" (1/1) ... [2023-02-15 01:38:46,580 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:38:46" (1/1) ... [2023-02-15 01:38:46,581 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:38:46" (1/1) ... [2023-02-15 01:38:46,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 01:38:46,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 01:38:46,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 01:38:46,585 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 01:38:46,586 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:38:46" (1/1) ... [2023-02-15 01:38:46,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:38:46,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:38:46,618 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 01:38:46,651 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 01:38:46,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 01:38:46,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 01:38:46,667 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-15 01:38:46,667 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-15 01:38:46,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 01:38:46,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 01:38:46,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 01:38:46,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 01:38:46,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 01:38:46,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 01:38:46,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 01:38:46,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 01:38:46,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 01:38:46,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 01:38:46,798 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 01:38:46,800 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 01:38:47,112 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 01:38:47,131 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 01:38:47,132 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 01:38:47,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:38:47 BoogieIcfgContainer [2023-02-15 01:38:47,134 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 01:38:47,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 01:38:47,136 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 01:38:47,139 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 01:38:47,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:38:46" (1/3) ... [2023-02-15 01:38:47,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68149966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:38:47, skipping insertion in model container [2023-02-15 01:38:47,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:38:46" (2/3) ... [2023-02-15 01:38:47,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68149966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:38:47, skipping insertion in model container [2023-02-15 01:38:47,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:38:47" (3/3) ... [2023-02-15 01:38:47,141 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2023-02-15 01:38:47,160 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 01:38:47,160 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2023-02-15 01:38:47,214 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 01:38:47,219 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;@311d6521, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 01:38:47,219 INFO L358 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2023-02-15 01:38:47,224 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 48 states have (on average 1.9375) internal successors, (93), 81 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:38:47,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 01:38:47,230 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:38:47,231 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:38:47,232 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 01:38:47,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:38:47,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1813904761, now seen corresponding path program 1 times [2023-02-15 01:38:47,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:38:47,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575116940] [2023-02-15 01:38:47,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:47,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:38:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:47,546 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 01:38:47,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:38:47,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575116940] [2023-02-15 01:38:47,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575116940] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:38:47,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:38:47,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:38:47,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830190628] [2023-02-15 01:38:47,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:38:47,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:38:47,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:38:47,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:38:47,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:38:47,583 INFO L87 Difference]: Start difference. First operand has 85 states, 48 states have (on average 1.9375) internal successors, (93), 81 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 01:38:47,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:38:47,675 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2023-02-15 01:38:47,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:38:47,678 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), 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 7 [2023-02-15 01:38:47,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:38:47,686 INFO L225 Difference]: With dead ends: 83 [2023-02-15 01:38:47,687 INFO L226 Difference]: Without dead ends: 80 [2023-02-15 01:38:47,688 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 01:38:47,692 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 8 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:38:47,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 130 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:38:47,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-15 01:38:47,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-02-15 01:38:47,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 46 states have (on average 1.7826086956521738) internal successors, (82), 76 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:38:47,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2023-02-15 01:38:47,731 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 7 [2023-02-15 01:38:47,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:38:47,732 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2023-02-15 01:38:47,732 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), 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 01:38:47,732 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2023-02-15 01:38:47,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 01:38:47,733 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:38:47,733 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:38:47,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 01:38:47,734 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 01:38:47,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:38:47,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1813904762, now seen corresponding path program 1 times [2023-02-15 01:38:47,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:38:47,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999633143] [2023-02-15 01:38:47,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:47,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:38:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:47,884 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 01:38:47,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:38:47,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999633143] [2023-02-15 01:38:47,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999633143] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:38:47,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:38:47,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:38:47,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133917105] [2023-02-15 01:38:47,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:38:47,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:38:47,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:38:47,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:38:47,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:38:47,890 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 01:38:47,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:38:47,968 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2023-02-15 01:38:47,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:38:47,973 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), 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 7 [2023-02-15 01:38:47,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:38:47,978 INFO L225 Difference]: With dead ends: 78 [2023-02-15 01:38:47,978 INFO L226 Difference]: Without dead ends: 78 [2023-02-15 01:38:47,981 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 01:38:47,983 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:38:47,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 130 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:38:47,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-15 01:38:47,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-02-15 01:38:47,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 46 states have (on average 1.7391304347826086) internal successors, (80), 74 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:38:47,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2023-02-15 01:38:48,001 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 7 [2023-02-15 01:38:48,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:38:48,001 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2023-02-15 01:38:48,001 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), 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 01:38:48,002 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2023-02-15 01:38:48,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 01:38:48,004 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:38:48,004 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:38:48,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 01:38:48,005 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 01:38:48,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:38:48,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1961810752, now seen corresponding path program 1 times [2023-02-15 01:38:48,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:38:48,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239037987] [2023-02-15 01:38:48,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:48,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:38:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:48,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:38:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:48,177 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 01:38:48,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:38:48,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239037987] [2023-02-15 01:38:48,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239037987] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:38:48,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:38:48,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 01:38:48,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256339005] [2023-02-15 01:38:48,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:38:48,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:38:48,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:38:48,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:38:48,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:38:48,181 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:38:48,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:38:48,382 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2023-02-15 01:38:48,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:38:48,383 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-02-15 01:38:48,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:38:48,388 INFO L225 Difference]: With dead ends: 82 [2023-02-15 01:38:48,388 INFO L226 Difference]: Without dead ends: 82 [2023-02-15 01:38:48,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:38:48,397 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 11 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:38:48,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 300 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:38:48,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-15 01:38:48,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2023-02-15 01:38:48,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:38:48,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2023-02-15 01:38:48,408 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 13 [2023-02-15 01:38:48,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:38:48,408 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2023-02-15 01:38:48,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:38:48,409 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2023-02-15 01:38:48,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 01:38:48,409 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:38:48,409 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:38:48,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 01:38:48,410 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 01:38:48,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:38:48,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1961810753, now seen corresponding path program 1 times [2023-02-15 01:38:48,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:38:48,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851338108] [2023-02-15 01:38:48,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:48,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:38:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:48,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:38:48,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:48,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:38:48,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:38:48,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851338108] [2023-02-15 01:38:48,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851338108] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:38:48,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:38:48,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 01:38:48,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449604851] [2023-02-15 01:38:48,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:38:48,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:38:48,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:38:48,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:38:48,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:38:48,706 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:38:48,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:38:48,866 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2023-02-15 01:38:48,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:38:48,867 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-02-15 01:38:48,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:38:48,868 INFO L225 Difference]: With dead ends: 81 [2023-02-15 01:38:48,868 INFO L226 Difference]: Without dead ends: 81 [2023-02-15 01:38:48,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:38:48,869 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 9 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:38:48,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 316 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:38:48,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-15 01:38:48,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2023-02-15 01:38:48,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 72 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:38:48,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2023-02-15 01:38:48,875 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 13 [2023-02-15 01:38:48,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:38:48,875 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2023-02-15 01:38:48,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:38:48,875 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2023-02-15 01:38:48,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 01:38:48,876 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:38:48,876 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:38:48,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 01:38:48,877 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 01:38:48,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:38:48,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1399608384, now seen corresponding path program 1 times [2023-02-15 01:38:48,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:38:48,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686617319] [2023-02-15 01:38:48,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:48,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:38:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:48,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 01:38:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:48,968 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 01:38:48,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:38:48,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686617319] [2023-02-15 01:38:48,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686617319] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:38:48,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:38:48,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:38:48,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295985772] [2023-02-15 01:38:48,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:38:48,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:38:48,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:38:48,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:38:48,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:38:48,973 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:38:49,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:38:49,034 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2023-02-15 01:38:49,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:38:49,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-02-15 01:38:49,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:38:49,039 INFO L225 Difference]: With dead ends: 82 [2023-02-15 01:38:49,039 INFO L226 Difference]: Without dead ends: 82 [2023-02-15 01:38:49,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:38:49,040 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 4 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:38:49,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 192 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:38:49,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-15 01:38:49,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2023-02-15 01:38:49,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:38:49,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2023-02-15 01:38:49,055 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 15 [2023-02-15 01:38:49,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:38:49,055 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2023-02-15 01:38:49,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:38:49,055 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2023-02-15 01:38:49,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 01:38:49,056 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:38:49,056 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:38:49,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 01:38:49,056 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 01:38:49,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:38:49,056 INFO L85 PathProgramCache]: Analyzing trace with hash -898428094, now seen corresponding path program 1 times [2023-02-15 01:38:49,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:38:49,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13155392] [2023-02-15 01:38:49,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:49,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:38:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:49,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:38:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:49,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 01:38:49,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:49,165 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 01:38:49,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:38:49,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13155392] [2023-02-15 01:38:49,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13155392] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:38:49,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856179943] [2023-02-15 01:38:49,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:49,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:38:49,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:38:49,177 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 01:38:49,198 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 01:38:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:49,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 01:38:49,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:38:49,347 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:38:49,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:38:49,396 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 01:38:49,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856179943] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:38:49,396 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:38:49,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-02-15 01:38:49,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069930573] [2023-02-15 01:38:49,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:38:49,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 01:38:49,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:38:49,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 01:38:49,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:38:49,400 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 01:38:49,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:38:49,470 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2023-02-15 01:38:49,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:38:49,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2023-02-15 01:38:49,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:38:49,471 INFO L225 Difference]: With dead ends: 83 [2023-02-15 01:38:49,472 INFO L226 Difference]: Without dead ends: 83 [2023-02-15 01:38:49,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:38:49,473 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 4 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:38:49,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 267 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:38:49,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-15 01:38:49,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-02-15 01:38:49,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.6153846153846154) internal successors, (84), 78 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:38:49,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2023-02-15 01:38:49,477 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 28 [2023-02-15 01:38:49,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:38:49,478 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2023-02-15 01:38:49,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 01:38:49,478 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2023-02-15 01:38:49,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 01:38:49,479 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:38:49,479 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:38:49,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 01:38:49,684 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,SelfDestructingSolverStorable5 [2023-02-15 01:38:49,685 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 01:38:49,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:38:49,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1437186176, now seen corresponding path program 2 times [2023-02-15 01:38:49,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:38:49,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060599242] [2023-02-15 01:38:49,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:49,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:38:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:49,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:38:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:50,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:38:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:50,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:38:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:50,199 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-15 01:38:50,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:38:50,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060599242] [2023-02-15 01:38:50,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060599242] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:38:50,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:38:50,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 01:38:50,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213359067] [2023-02-15 01:38:50,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:38:50,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:38:50,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:38:50,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:38:50,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:38:50,202 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:38:50,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:38:50,344 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2023-02-15 01:38:50,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:38:50,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2023-02-15 01:38:50,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:38:50,345 INFO L225 Difference]: With dead ends: 90 [2023-02-15 01:38:50,345 INFO L226 Difference]: Without dead ends: 90 [2023-02-15 01:38:50,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:38:50,346 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 110 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:38:50,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 173 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:38:50,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-15 01:38:50,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2023-02-15 01:38:50,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 73 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:38:50,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2023-02-15 01:38:50,351 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 41 [2023-02-15 01:38:50,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:38:50,351 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2023-02-15 01:38:50,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:38:50,352 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2023-02-15 01:38:50,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 01:38:50,352 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:38:50,353 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:38:50,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 01:38:50,353 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 01:38:50,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:38:50,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1437186175, now seen corresponding path program 1 times [2023-02-15 01:38:50,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:38:50,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442481860] [2023-02-15 01:38:50,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:50,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:38:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:50,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:38:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:50,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:38:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:50,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:38:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:51,022 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-15 01:38:51,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:38:51,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442481860] [2023-02-15 01:38:51,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442481860] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:38:51,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176543326] [2023-02-15 01:38:51,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:51,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:38:51,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:38:51,024 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 01:38:51,048 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 01:38:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:51,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 01:38:51,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:38:51,213 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 01:38:51,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:38:51,285 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_452 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_452))))) is different from true [2023-02-15 01:38:51,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:38:51,360 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 01:38:51,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:38:51,400 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_453 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_453) |c_#length|)))) is different from true [2023-02-15 01:38:51,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:38:51,446 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 01:38:51,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:38:51,522 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_454 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_454) |c_#length|)))) is different from true [2023-02-15 01:38:51,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:38:51,572 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 01:38:51,591 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 18 not checked. [2023-02-15 01:38:51,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:38:51,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176543326] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:38:51,685 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:38:51,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2023-02-15 01:38:51,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120972722] [2023-02-15 01:38:51,686 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:38:51,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 01:38:51,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:38:51,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 01:38:51,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=220, Unknown=3, NotChecked=96, Total=380 [2023-02-15 01:38:51,688 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 18 states, 15 states have (on average 3.8) internal successors, (57), 16 states have internal predecessors, (57), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 01:38:51,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:38:51,938 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2023-02-15 01:38:51,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 01:38:51,939 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.8) internal successors, (57), 16 states have internal predecessors, (57), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2023-02-15 01:38:51,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:38:51,940 INFO L225 Difference]: With dead ends: 85 [2023-02-15 01:38:51,940 INFO L226 Difference]: Without dead ends: 85 [2023-02-15 01:38:51,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=268, Unknown=3, NotChecked=108, Total=462 [2023-02-15 01:38:51,941 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 313 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 198 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:38:51,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 186 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 244 Invalid, 0 Unknown, 198 Unchecked, 0.2s Time] [2023-02-15 01:38:51,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-15 01:38:51,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2023-02-15 01:38:51,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 68 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:38:51,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2023-02-15 01:38:51,944 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 41 [2023-02-15 01:38:51,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:38:51,945 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2023-02-15 01:38:51,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 3.8) internal successors, (57), 16 states have internal predecessors, (57), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 01:38:51,945 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2023-02-15 01:38:51,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 01:38:51,946 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:38:51,946 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:38:51,953 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 01:38:52,146 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,SelfDestructingSolverStorable7 [2023-02-15 01:38:52,147 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 01:38:52,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:38:52,147 INFO L85 PathProgramCache]: Analyzing trace with hash 2129253767, now seen corresponding path program 1 times [2023-02-15 01:38:52,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:38:52,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861069587] [2023-02-15 01:38:52,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:52,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:38:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:52,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:38:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:52,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:38:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:52,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:38:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:53,147 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 01:38:53,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:38:53,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861069587] [2023-02-15 01:38:53,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861069587] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:38:53,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769011679] [2023-02-15 01:38:53,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:53,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:38:53,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:38:53,149 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 01:38:53,174 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 01:38:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:53,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 66 conjunts are in the unsatisfiable core [2023-02-15 01:38:53,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:38:53,664 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 11 [2023-02-15 01:38:53,667 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 7 treesize of output 3 [2023-02-15 01:38:53,799 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_616 (Array Int Int)) (v_ArrVal_615 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_615)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_616)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 01:38:53,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:38:53,846 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 25 treesize of output 25 [2023-02-15 01:38:53,860 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 01:38:53,861 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 15 treesize of output 15 [2023-02-15 01:38:53,870 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 18 treesize of output 13 [2023-02-15 01:38:53,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:38:53,875 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 01:38:53,928 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 01:38:53,931 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 17 treesize of output 9 [2023-02-15 01:38:53,985 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2023-02-15 01:38:53,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:38:54,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769011679] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:38:54,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:38:54,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2023-02-15 01:38:54,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334126664] [2023-02-15 01:38:54,893 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:38:54,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-15 01:38:54,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:38:54,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-15 01:38:54,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1084, Unknown=1, NotChecked=66, Total=1260 [2023-02-15 01:38:54,895 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 32 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 01:38:56,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:38:56,242 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2023-02-15 01:38:56,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 01:38:56,243 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 45 [2023-02-15 01:38:56,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:38:56,244 INFO L225 Difference]: With dead ends: 112 [2023-02-15 01:38:56,244 INFO L226 Difference]: Without dead ends: 112 [2023-02-15 01:38:56,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=241, Invalid=2018, Unknown=1, NotChecked=92, Total=2352 [2023-02-15 01:38:56,245 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 343 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 01:38:56,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 924 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 996 Invalid, 0 Unknown, 104 Unchecked, 0.6s Time] [2023-02-15 01:38:56,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-15 01:38:56,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 77. [2023-02-15 01:38:56,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 72 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:38:56,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2023-02-15 01:38:56,249 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 45 [2023-02-15 01:38:56,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:38:56,250 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2023-02-15 01:38:56,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 01:38:56,250 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2023-02-15 01:38:56,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 01:38:56,251 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:38:56,251 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:38:56,263 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 01:38:56,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:38:56,457 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 01:38:56,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:38:56,458 INFO L85 PathProgramCache]: Analyzing trace with hash 2129253766, now seen corresponding path program 1 times [2023-02-15 01:38:56,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:38:56,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196518813] [2023-02-15 01:38:56,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:56,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:38:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:56,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:38:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:56,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:38:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:56,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:38:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:56,966 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 01:38:56,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:38:56,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196518813] [2023-02-15 01:38:56,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196518813] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:38:56,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283840533] [2023-02-15 01:38:56,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:56,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:38:56,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:38:56,969 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 01:38:56,993 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 01:38:57,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:57,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-15 01:38:57,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:38:57,317 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 9 treesize of output 5 [2023-02-15 01:38:57,410 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_784 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_784) |c_#memory_$Pointer$.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2023-02-15 01:38:57,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:38:57,432 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 01:38:57,442 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-02-15 01:38:57,442 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 16 treesize of output 18 [2023-02-15 01:38:57,507 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 17 treesize of output 9 [2023-02-15 01:38:57,521 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-15 01:38:57,521 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:38:57,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283840533] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:38:57,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 01:38:57,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 26 [2023-02-15 01:38:57,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037783679] [2023-02-15 01:38:57,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:38:57,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 01:38:57,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:38:57,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 01:38:57,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=575, Unknown=2, NotChecked=48, Total=702 [2023-02-15 01:38:57,523 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:38:57,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:38:57,916 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2023-02-15 01:38:57,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 01:38:57,917 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2023-02-15 01:38:57,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:38:57,918 INFO L225 Difference]: With dead ends: 104 [2023-02-15 01:38:57,918 INFO L226 Difference]: Without dead ends: 104 [2023-02-15 01:38:57,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=811, Unknown=2, NotChecked=58, Total=992 [2023-02-15 01:38:57,919 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 60 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:38:57,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 518 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 415 Invalid, 3 Unknown, 120 Unchecked, 0.3s Time] [2023-02-15 01:38:57,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-15 01:38:57,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 75. [2023-02-15 01:38:57,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 56 states have (on average 1.375) internal successors, (77), 70 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:38:57,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2023-02-15 01:38:57,922 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 45 [2023-02-15 01:38:57,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:38:57,922 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2023-02-15 01:38:57,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:38:57,922 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2023-02-15 01:38:57,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 01:38:57,923 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:38:57,923 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:38:57,936 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 01:38:58,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:38:58,136 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 01:38:58,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:38:58,137 INFO L85 PathProgramCache]: Analyzing trace with hash -35949242, now seen corresponding path program 1 times [2023-02-15 01:38:58,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:38:58,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392328977] [2023-02-15 01:38:58,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:58,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:38:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:58,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:38:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:58,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:38:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:58,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:38:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:58,400 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 01:38:58,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:38:58,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392328977] [2023-02-15 01:38:58,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392328977] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:38:58,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:38:58,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 01:38:58,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11198766] [2023-02-15 01:38:58,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:38:58,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 01:38:58,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:38:58,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 01:38:58,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-15 01:38:58,403 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:38:58,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:38:58,634 INFO L93 Difference]: Finished difference Result 136 states and 149 transitions. [2023-02-15 01:38:58,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 01:38:58,634 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2023-02-15 01:38:58,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:38:58,636 INFO L225 Difference]: With dead ends: 136 [2023-02-15 01:38:58,636 INFO L226 Difference]: Without dead ends: 136 [2023-02-15 01:38:58,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-02-15 01:38:58,637 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 164 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:38:58,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 310 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:38:58,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-15 01:38:58,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 79. [2023-02-15 01:38:58,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 61 states have (on average 1.360655737704918) internal successors, (83), 74 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:38:58,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2023-02-15 01:38:58,640 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 48 [2023-02-15 01:38:58,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:38:58,641 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2023-02-15 01:38:58,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:38:58,641 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2023-02-15 01:38:58,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 01:38:58,642 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:38:58,642 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:38:58,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 01:38:58,642 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 01:38:58,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:38:58,643 INFO L85 PathProgramCache]: Analyzing trace with hash -35949241, now seen corresponding path program 1 times [2023-02-15 01:38:58,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:38:58,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185555873] [2023-02-15 01:38:58,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:58,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:38:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:58,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:38:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:58,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:38:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:58,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:38:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:59,017 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-15 01:38:59,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:38:59,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185555873] [2023-02-15 01:38:59,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185555873] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:38:59,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:38:59,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 01:38:59,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743066137] [2023-02-15 01:38:59,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:38:59,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 01:38:59,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:38:59,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 01:38:59,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-15 01:38:59,021 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:38:59,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:38:59,248 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2023-02-15 01:38:59,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 01:38:59,249 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2023-02-15 01:38:59,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:38:59,250 INFO L225 Difference]: With dead ends: 126 [2023-02-15 01:38:59,250 INFO L226 Difference]: Without dead ends: 126 [2023-02-15 01:38:59,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-02-15 01:38:59,250 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 150 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:38:59,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 323 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:38:59,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-15 01:38:59,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 81. [2023-02-15 01:38:59,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 76 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:38:59,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2023-02-15 01:38:59,254 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 48 [2023-02-15 01:38:59,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:38:59,255 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2023-02-15 01:38:59,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:38:59,255 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2023-02-15 01:38:59,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 01:38:59,257 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:38:59,257 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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 01:38:59,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 01:38:59,258 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 01:38:59,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:38:59,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1114427801, now seen corresponding path program 1 times [2023-02-15 01:38:59,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:38:59,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961269223] [2023-02-15 01:38:59,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:59,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:38:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:59,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:38:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:59,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:38:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:59,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:38:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:38:59,576 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-15 01:38:59,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:38:59,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961269223] [2023-02-15 01:38:59,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961269223] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:38:59,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:38:59,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 01:38:59,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009999621] [2023-02-15 01:38:59,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:38:59,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 01:38:59,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:38:59,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 01:38:59,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-15 01:38:59,579 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:38:59,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:38:59,754 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2023-02-15 01:38:59,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 01:38:59,755 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2023-02-15 01:38:59,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:38:59,755 INFO L225 Difference]: With dead ends: 109 [2023-02-15 01:38:59,755 INFO L226 Difference]: Without dead ends: 109 [2023-02-15 01:38:59,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-02-15 01:38:59,756 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 152 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:38:59,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 508 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:38:59,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-15 01:38:59,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 81. [2023-02-15 01:38:59,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 76 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:38:59,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2023-02-15 01:38:59,758 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 49 [2023-02-15 01:38:59,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:38:59,759 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2023-02-15 01:38:59,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:38:59,759 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2023-02-15 01:38:59,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 01:38:59,759 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:38:59,759 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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 01:38:59,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 01:38:59,760 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 01:38:59,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:38:59,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1553828739, now seen corresponding path program 1 times [2023-02-15 01:38:59,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:38:59,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448648400] [2023-02-15 01:38:59,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:38:59,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:38:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:00,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:39:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:00,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:39:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:01,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:39:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:01,606 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:39:01,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:39:01,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448648400] [2023-02-15 01:39:01,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448648400] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:01,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375655167] [2023-02-15 01:39:01,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:01,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:39:01,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:39:01,609 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 01:39:01,624 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 01:39:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:01,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 104 conjunts are in the unsatisfiable core [2023-02-15 01:39:01,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:39:02,144 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:39:02,144 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 01:39:02,156 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 14 treesize of output 16 [2023-02-15 01:39:02,292 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 13 treesize of output 9 [2023-02-15 01:39:02,298 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 13 treesize of output 9 [2023-02-15 01:39:02,658 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:39:02,659 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 75 treesize of output 38 [2023-02-15 01:39:02,668 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:39:02,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2023-02-15 01:39:02,899 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1257 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1257))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1261 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1261) |c_#memory_$Pointer$.offset|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1260 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1260) |c_#memory_$Pointer$.base|)))) is different from true [2023-02-15 01:39:02,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:02,944 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:39:02,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 69 [2023-02-15 01:39:02,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:02,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:02,957 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 01:39:02,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2023-02-15 01:39:02,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:02,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 30 treesize of output 32 [2023-02-15 01:39:02,980 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 01:39:02,980 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 28 treesize of output 30 [2023-02-15 01:39:03,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:03,263 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:39:03,265 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:39:03,266 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 3 case distinctions, treesize of input 87 treesize of output 47 [2023-02-15 01:39:03,274 INFO L321 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2023-02-15 01:39:03,274 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 27 [2023-02-15 01:39:03,359 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-02-15 01:39:03,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:39:05,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375655167] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:05,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:39:05,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22] total 48 [2023-02-15 01:39:05,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657114113] [2023-02-15 01:39:05,102 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:39:05,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-02-15 01:39:05,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:39:05,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-02-15 01:39:05,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2496, Unknown=2, NotChecked=100, Total=2756 [2023-02-15 01:39:05,104 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 49 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 43 states have internal predecessors, (85), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:39:10,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:39:10,373 INFO L93 Difference]: Finished difference Result 183 states and 200 transitions. [2023-02-15 01:39:10,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-15 01:39:10,373 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 43 states have internal predecessors, (85), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 49 [2023-02-15 01:39:10,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:39:10,374 INFO L225 Difference]: With dead ends: 183 [2023-02-15 01:39:10,374 INFO L226 Difference]: Without dead ends: 183 [2023-02-15 01:39:10,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1109 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=698, Invalid=5466, Unknown=2, NotChecked=154, Total=6320 [2023-02-15 01:39:10,376 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 1320 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 1997 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1320 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 2208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 162 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-02-15 01:39:10,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1320 Valid, 1347 Invalid, 2208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1997 Invalid, 0 Unknown, 162 Unchecked, 1.6s Time] [2023-02-15 01:39:10,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-02-15 01:39:10,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 80. [2023-02-15 01:39:10,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 64 states have (on average 1.296875) internal successors, (83), 75 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:39:10,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2023-02-15 01:39:10,380 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 49 [2023-02-15 01:39:10,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:39:10,380 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2023-02-15 01:39:10,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 43 states have internal predecessors, (85), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:39:10,380 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2023-02-15 01:39:10,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 01:39:10,381 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:39:10,381 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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 01:39:10,391 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 01:39:10,587 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,SelfDestructingSolverStorable13 [2023-02-15 01:39:10,589 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 01:39:10,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:39:10,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1553828740, now seen corresponding path program 1 times [2023-02-15 01:39:10,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:39:10,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561527651] [2023-02-15 01:39:10,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:10,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:39:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:11,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:39:11,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:11,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:39:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:11,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:39:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:12,086 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:39:12,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:39:12,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561527651] [2023-02-15 01:39:12,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561527651] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:12,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118177678] [2023-02-15 01:39:12,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:12,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:39:12,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:39:12,093 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 01:39:12,132 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 01:39:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:12,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 91 conjunts are in the unsatisfiable core [2023-02-15 01:39:12,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:39:12,528 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-02-15 01:39:12,529 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 19 treesize of output 16 [2023-02-15 01:39:12,632 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 13 treesize of output 9 [2023-02-15 01:39:12,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:12,863 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:39:12,863 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 51 treesize of output 18 [2023-02-15 01:39:12,874 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 01:39:13,011 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1433 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1433))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1434 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1434))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2023-02-15 01:39:13,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:13,063 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:39:13,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 55 [2023-02-15 01:39:13,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:13,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2023-02-15 01:39:13,108 INFO L321 Elim1Store]: treesize reduction 90, result has 37.9 percent of original size [2023-02-15 01:39:13,108 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 40 treesize of output 69 [2023-02-15 01:39:13,279 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 81 treesize of output 57 [2023-02-15 01:39:13,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:13,511 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:39:13,511 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 78 treesize of output 29 [2023-02-15 01:39:13,639 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-02-15 01:39:13,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:39:13,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118177678] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:13,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:39:13,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 45 [2023-02-15 01:39:13,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052325382] [2023-02-15 01:39:13,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:39:13,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-15 01:39:13,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:39:13,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-15 01:39:13,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2177, Unknown=2, NotChecked=94, Total=2450 [2023-02-15 01:39:13,886 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 46 states, 43 states have (on average 1.930232558139535) internal successors, (83), 40 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:39:16,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:39:16,437 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2023-02-15 01:39:16,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 01:39:16,438 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 1.930232558139535) internal successors, (83), 40 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 49 [2023-02-15 01:39:16,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:39:16,438 INFO L225 Difference]: With dead ends: 122 [2023-02-15 01:39:16,438 INFO L226 Difference]: Without dead ends: 122 [2023-02-15 01:39:16,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1120 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=528, Invalid=4164, Unknown=4, NotChecked=134, Total=4830 [2023-02-15 01:39:16,440 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 599 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 1561 mSolverCounterSat, 27 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 1353 SdHoareTripleChecker+Invalid, 1700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1561 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:39:16,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 1353 Invalid, 1700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1561 Invalid, 3 Unknown, 109 Unchecked, 1.0s Time] [2023-02-15 01:39:16,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-15 01:39:16,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 80. [2023-02-15 01:39:16,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 64 states have (on average 1.28125) internal successors, (82), 75 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:39:16,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2023-02-15 01:39:16,444 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 49 [2023-02-15 01:39:16,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:39:16,444 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2023-02-15 01:39:16,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 1.930232558139535) internal successors, (83), 40 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:39:16,445 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2023-02-15 01:39:16,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 01:39:16,445 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:39:16,445 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2023-02-15 01:39:16,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-15 01:39:16,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-15 01:39:16,652 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 01:39:16,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:39:16,652 INFO L85 PathProgramCache]: Analyzing trace with hash 218878957, now seen corresponding path program 1 times [2023-02-15 01:39:16,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:39:16,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220071953] [2023-02-15 01:39:16,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:16,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:39:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:16,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:39:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:16,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:39:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:16,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:39:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:17,051 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 01:39:17,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:39:17,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220071953] [2023-02-15 01:39:17,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220071953] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:17,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729223738] [2023-02-15 01:39:17,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:17,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:39:17,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:39:17,053 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 01:39:17,056 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 01:39:17,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:17,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 60 conjunts are in the unsatisfiable core [2023-02-15 01:39:17,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:39:17,387 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 01:39:17,552 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 01:39:17,557 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 01:39:17,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:17,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 01:39:17,607 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 28 treesize of output 16 [2023-02-15 01:39:17,611 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 01:39:17,682 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 01:39:17,706 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-15 01:39:17,706 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:39:17,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729223738] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:39:17,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 01:39:17,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 27 [2023-02-15 01:39:17,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136976783] [2023-02-15 01:39:17,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:39:17,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 01:39:17,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:39:17,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 01:39:17,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2023-02-15 01:39:17,708 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:39:18,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:39:18,132 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2023-02-15 01:39:18,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 01:39:18,133 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2023-02-15 01:39:18,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:39:18,134 INFO L225 Difference]: With dead ends: 106 [2023-02-15 01:39:18,134 INFO L226 Difference]: Without dead ends: 106 [2023-02-15 01:39:18,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2023-02-15 01:39:18,135 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 138 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:39:18,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 530 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:39:18,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-15 01:39:18,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 81. [2023-02-15 01:39:18,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 76 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:39:18,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2023-02-15 01:39:18,138 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 52 [2023-02-15 01:39:18,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:39:18,139 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2023-02-15 01:39:18,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:39:18,139 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2023-02-15 01:39:18,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 01:39:18,140 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:39:18,140 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2023-02-15 01:39:18,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-15 01:39:18,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:39:18,346 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 01:39:18,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:39:18,346 INFO L85 PathProgramCache]: Analyzing trace with hash -521057353, now seen corresponding path program 1 times [2023-02-15 01:39:18,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:39:18,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026296059] [2023-02-15 01:39:18,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:18,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:39:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:18,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:39:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:18,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:39:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:18,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:39:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:18,887 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 01:39:18,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:39:18,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026296059] [2023-02-15 01:39:18,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026296059] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:18,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184263112] [2023-02-15 01:39:18,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:18,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:39:18,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:39:18,893 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 01:39:18,901 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 01:39:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:19,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 63 conjunts are in the unsatisfiable core [2023-02-15 01:39:19,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:39:19,104 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 01:39:19,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:39:19,149 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1784 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_1784))) is different from true [2023-02-15 01:39:19,156 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1784 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_1784))) is different from true [2023-02-15 01:39:19,171 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:39:19,172 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 01:39:19,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:39:19,328 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:39:19,329 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 01:39:19,553 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 18 treesize of output 10 [2023-02-15 01:39:19,671 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1787 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1787))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1785 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1785))))) is different from true [2023-02-15 01:39:19,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:19,698 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 24 treesize of output 24 [2023-02-15 01:39:19,715 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-15 01:39:19,716 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 21 treesize of output 29 [2023-02-15 01:39:19,872 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:39:19,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-15 01:39:19,912 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 01:39:19,917 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 15 not checked. [2023-02-15 01:39:19,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:39:19,977 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem9#1.base| v_ArrVal_1788) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2023-02-15 01:39:20,090 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int)) (v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1795 Int) (|v_node_create_~temp~0#1.base_31| Int)) (or (not (= 0 (select |c_#valid| |v_node_create_~temp~0#1.base_31|))) (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_31| v_ArrVal_1795) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_31| v_ArrVal_1794))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) v_ArrVal_1788)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1) (not (< |v_node_create_~temp~0#1.base_31| |c_#StackHeapBarrier|)))) is different from false [2023-02-15 01:39:20,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184263112] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:20,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:39:20,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 42 [2023-02-15 01:39:20,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165781868] [2023-02-15 01:39:20,092 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:39:20,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-02-15 01:39:20,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:39:20,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-02-15 01:39:20,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1560, Unknown=26, NotChecked=420, Total=2162 [2023-02-15 01:39:20,094 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 43 states, 40 states have (on average 2.15) internal successors, (86), 37 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 01:39:21,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:39:21,112 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2023-02-15 01:39:21,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 01:39:21,113 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 40 states have (on average 2.15) internal successors, (86), 37 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 52 [2023-02-15 01:39:21,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:39:21,114 INFO L225 Difference]: With dead ends: 156 [2023-02-15 01:39:21,114 INFO L226 Difference]: Without dead ends: 156 [2023-02-15 01:39:21,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=469, Invalid=2947, Unknown=26, NotChecked=590, Total=4032 [2023-02-15 01:39:21,116 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 949 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 24 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 341 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 01:39:21,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 686 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1032 Invalid, 3 Unknown, 341 Unchecked, 0.5s Time] [2023-02-15 01:39:21,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-15 01:39:21,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 87. [2023-02-15 01:39:21,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 82 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:39:21,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2023-02-15 01:39:21,119 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 52 [2023-02-15 01:39:21,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:39:21,120 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2023-02-15 01:39:21,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 40 states have (on average 2.15) internal successors, (86), 37 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 01:39:21,120 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2023-02-15 01:39:21,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 01:39:21,120 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:39:21,121 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2023-02-15 01:39:21,130 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 01:39:21,327 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,SelfDestructingSolverStorable16 [2023-02-15 01:39:21,327 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 01:39:21,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:39:21,328 INFO L85 PathProgramCache]: Analyzing trace with hash -521057352, now seen corresponding path program 1 times [2023-02-15 01:39:21,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:39:21,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368085137] [2023-02-15 01:39:21,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:21,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:39:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:22,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:39:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:22,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:39:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:22,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:39:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:22,315 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 01:39:22,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:39:22,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368085137] [2023-02-15 01:39:22,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368085137] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:22,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151223401] [2023-02-15 01:39:22,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:22,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:39:22,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:39:22,318 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 01:39:22,327 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 01:39:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:22,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 71 conjunts are in the unsatisfiable core [2023-02-15 01:39:22,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:39:22,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-15 01:39:22,836 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 7 treesize of output 3 [2023-02-15 01:39:22,935 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1965 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_ArrVal_1964 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1965)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1964)))) is different from true [2023-02-15 01:39:22,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:22,956 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 24 treesize of output 24 [2023-02-15 01:39:22,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:22,965 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 01:39:23,264 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:39:23,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 62 [2023-02-15 01:39:23,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:23,275 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 36 treesize of output 27 [2023-02-15 01:39:23,281 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 01:39:23,335 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 40 treesize of output 24 [2023-02-15 01:39:23,339 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 26 treesize of output 14 [2023-02-15 01:39:23,410 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2023-02-15 01:39:23,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:39:23,524 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (and (forall ((v_ArrVal_1966 Int)) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store .cse0 .cse1 v_ArrVal_1966)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_1966 Int) (v_ArrVal_1968 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store .cse0 .cse1 v_ArrVal_1966)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-02-15 01:39:23,614 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:39:23,614 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 57 treesize of output 61 [2023-02-15 01:39:25,333 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_node_create_~temp~0#1.base_34| Int)) (or (not (< |v_node_create_~temp~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_34| v_ArrVal_1975))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (forall ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_17| Int)) (or (not (= (select (select .cse0 .cse1) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_17| 4)) 0)) (< |v_ULTIMATE.start_sll_append_~last~0#1.offset_17| (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_34| v_ArrVal_1976) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)))) (forall ((v_ArrVal_1968 (Array Int Int))) (= .cse1 (select (select (store .cse0 .cse1 v_ArrVal_1968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) (forall ((|v_node_create_~temp~0#1.base_34| Int)) (or (not (< |v_node_create_~temp~0#1.base_34| |c_#StackHeapBarrier|)) (forall ((v_prenex_6 Int) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_17| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_34| v_ArrVal_1975))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_34| v_ArrVal_1976)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse4 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_17| 4))) (or (not (= (select (select .cse2 .cse3) .cse4) 0)) (< |v_ULTIMATE.start_sll_append_~last~0#1.offset_17| (select (select .cse5 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (<= 0 (+ (select (select (store .cse5 .cse3 (store (select .cse5 .cse3) .cse4 v_prenex_6)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))))) (forall ((|v_node_create_~temp~0#1.base_34| Int)) (or (forall ((v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_17| Int) (v_ArrVal_1966 Int)) (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_34| v_ArrVal_1975))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_34| v_ArrVal_1976)) (.cse7 (select (select .cse6 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse8 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_17| 4))) (or (not (= (select (select .cse6 .cse7) .cse8) 0)) (< |v_ULTIMATE.start_sll_append_~last~0#1.offset_17| (select (select .cse9 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (< (select (select (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 v_ArrVal_1966)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_17| 1)))))) (not (< |v_node_create_~temp~0#1.base_34| |c_#StackHeapBarrier|))))) is different from false [2023-02-15 01:39:25,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151223401] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:25,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:39:25,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 37 [2023-02-15 01:39:25,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763332633] [2023-02-15 01:39:25,337 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:39:25,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-15 01:39:25,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:39:25,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-15 01:39:25,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1748, Unknown=3, NotChecked=258, Total=2162 [2023-02-15 01:39:25,338 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand has 38 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 34 states have internal predecessors, (76), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 01:39:26,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:39:26,847 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2023-02-15 01:39:26,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 01:39:26,847 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 34 states have internal predecessors, (76), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 52 [2023-02-15 01:39:26,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:39:26,848 INFO L225 Difference]: With dead ends: 117 [2023-02-15 01:39:26,848 INFO L226 Difference]: Without dead ends: 117 [2023-02-15 01:39:26,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 898 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=452, Invalid=3217, Unknown=3, NotChecked=360, Total=4032 [2023-02-15 01:39:26,849 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 577 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 01:39:26,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 811 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 793 Invalid, 0 Unknown, 104 Unchecked, 0.5s Time] [2023-02-15 01:39:26,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-15 01:39:26,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 89. [2023-02-15 01:39:26,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 84 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:39:26,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2023-02-15 01:39:26,853 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 52 [2023-02-15 01:39:26,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:39:26,853 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2023-02-15 01:39:26,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 34 states have internal predecessors, (76), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 01:39:26,854 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2023-02-15 01:39:26,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 01:39:26,854 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:39:26,854 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2023-02-15 01:39:26,863 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 01:39:27,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-15 01:39:27,063 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 01:39:27,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:39:27,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1804686442, now seen corresponding path program 1 times [2023-02-15 01:39:27,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:39:27,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101543955] [2023-02-15 01:39:27,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:27,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:39:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:27,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:39:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:27,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:39:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:27,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:39:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:27,468 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 01:39:27,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:39:27,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101543955] [2023-02-15 01:39:27,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101543955] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:27,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118763847] [2023-02-15 01:39:27,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:27,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:39:27,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:39:27,471 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 01:39:27,499 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 01:39:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:27,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-15 01:39:27,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:39:27,912 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 17 treesize of output 9 [2023-02-15 01:39:27,968 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2144 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2144)))) is different from true [2023-02-15 01:39:27,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:27,981 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 24 treesize of output 24 [2023-02-15 01:39:28,013 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 01:39:28,034 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 3 not checked. [2023-02-15 01:39:28,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:39:28,100 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2148 (Array Int Int)) (|v_node_create_~temp~0#1.base_37| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_37| v_ArrVal_2148) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (not (< |v_node_create_~temp~0#1.base_37| |c_#StackHeapBarrier|)) (<= 1 .cse0) (<= (+ .cse0 1) 0)))) is different from false [2023-02-15 01:39:28,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118763847] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:28,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:39:28,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2023-02-15 01:39:28,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924161982] [2023-02-15 01:39:28,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:39:28,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-15 01:39:28,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:39:28,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-15 01:39:28,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=571, Unknown=2, NotChecked=98, Total=756 [2023-02-15 01:39:28,103 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 26 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 22 states have internal predecessors, (67), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 01:39:28,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:39:28,538 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2023-02-15 01:39:28,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 01:39:28,539 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 22 states have internal predecessors, (67), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 53 [2023-02-15 01:39:28,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:39:28,540 INFO L225 Difference]: With dead ends: 80 [2023-02-15 01:39:28,540 INFO L226 Difference]: Without dead ends: 80 [2023-02-15 01:39:28,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=956, Unknown=2, NotChecked=130, Total=1260 [2023-02-15 01:39:28,541 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 310 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:39:28,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 551 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 449 Invalid, 0 Unknown, 68 Unchecked, 0.2s Time] [2023-02-15 01:39:28,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-15 01:39:28,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-02-15 01:39:28,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 64 states have (on average 1.265625) internal successors, (81), 75 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:39:28,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2023-02-15 01:39:28,551 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 53 [2023-02-15 01:39:28,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:39:28,551 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2023-02-15 01:39:28,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 22 states have internal predecessors, (67), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 01:39:28,552 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2023-02-15 01:39:28,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 01:39:28,552 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:39:28,552 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2023-02-15 01:39:28,573 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 01:39:28,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:39:28,758 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 01:39:28,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:39:28,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1947817869, now seen corresponding path program 2 times [2023-02-15 01:39:28,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:39:28,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924741889] [2023-02-15 01:39:28,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:28,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:39:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:30,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:39:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:30,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:39:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:30,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:39:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:31,017 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:39:31,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:39:31,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924741889] [2023-02-15 01:39:31,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924741889] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:31,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420420416] [2023-02-15 01:39:31,018 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 01:39:31,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:39:31,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:39:31,019 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 01:39:31,020 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 01:39:31,200 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 01:39:31,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 01:39:31,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 131 conjunts are in the unsatisfiable core [2023-02-15 01:39:31,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:39:31,252 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 01:39:31,411 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 01:39:31,417 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 01:39:31,824 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:39:31,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-15 01:39:31,829 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 01:39:31,844 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-02-15 01:39:31,844 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 19 treesize of output 16 [2023-02-15 01:39:31,852 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 01:39:31,995 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 01:39:32,003 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 29 treesize of output 28 [2023-02-15 01:39:32,349 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-02-15 01:39:32,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 84 [2023-02-15 01:39:32,366 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-02-15 01:39:32,366 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 29 [2023-02-15 01:39:32,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:39:32,503 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2319 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_ArrVal_2320 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2319)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2320)))) is different from true [2023-02-15 01:39:32,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:32,554 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-15 01:39:32,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 165 treesize of output 149 [2023-02-15 01:39:32,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:32,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:32,573 INFO L321 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2023-02-15 01:39:32,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 156 treesize of output 135 [2023-02-15 01:39:32,603 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-02-15 01:39:32,604 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 34 treesize of output 36 [2023-02-15 01:39:33,144 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-02-15 01:39:33,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 205 treesize of output 96 [2023-02-15 01:39:33,157 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-02-15 01:39:33,157 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 32 [2023-02-15 01:39:33,203 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2023-02-15 01:39:33,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:39:33,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420420416] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:33,660 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:39:33,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28] total 52 [2023-02-15 01:39:33,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754522051] [2023-02-15 01:39:33,660 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:39:33,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-02-15 01:39:33,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:39:33,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-02-15 01:39:33,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=3027, Unknown=2, NotChecked=110, Total=3306 [2023-02-15 01:39:33,663 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 52 states, 50 states have (on average 1.68) internal successors, (84), 46 states have internal predecessors, (84), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:39:38,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:39:38,183 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2023-02-15 01:39:38,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 01:39:38,184 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 1.68) internal successors, (84), 46 states have internal predecessors, (84), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2023-02-15 01:39:38,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:39:38,185 INFO L225 Difference]: With dead ends: 105 [2023-02-15 01:39:38,185 INFO L226 Difference]: Without dead ends: 105 [2023-02-15 01:39:38,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1346 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=428, Invalid=5274, Unknown=2, NotChecked=148, Total=5852 [2023-02-15 01:39:38,186 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 153 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:39:38,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1201 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1359 Invalid, 0 Unknown, 95 Unchecked, 1.1s Time] [2023-02-15 01:39:38,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-15 01:39:38,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2023-02-15 01:39:38,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 93 states have internal predecessors, (101), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 01:39:38,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2023-02-15 01:39:38,189 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 53 [2023-02-15 01:39:38,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:39:38,190 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2023-02-15 01:39:38,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 1.68) internal successors, (84), 46 states have internal predecessors, (84), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:39:38,190 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2023-02-15 01:39:38,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-15 01:39:38,190 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:39:38,190 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2023-02-15 01:39:38,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-02-15 01:39:38,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:39:38,397 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 01:39:38,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:39:38,397 INFO L85 PathProgramCache]: Analyzing trace with hash 729745886, now seen corresponding path program 1 times [2023-02-15 01:39:38,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:39:38,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165183906] [2023-02-15 01:39:38,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:38,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:39:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:39,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:39:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:39,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:39:39,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:39,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:39:39,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:39,814 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 01:39:39,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:39:39,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165183906] [2023-02-15 01:39:39,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165183906] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:39,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208876298] [2023-02-15 01:39:39,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:39,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:39:39,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:39:39,816 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 01:39:39,817 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 01:39:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:40,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 105 conjunts are in the unsatisfiable core [2023-02-15 01:39:40,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:39:40,031 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 01:39:40,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:39:40,091 WARN L859 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((v_ArrVal_2496 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_2496)))) is different from true [2023-02-15 01:39:40,107 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2496 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_2496))) (not (= |c_node_create_#res#1.base| 0))) is different from true [2023-02-15 01:39:40,128 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:39:40,128 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 12 treesize of output 18 [2023-02-15 01:39:40,327 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 01:39:40,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:39:40,336 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 01:39:40,436 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-02-15 01:39:40,437 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 3 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 01:39:40,540 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:39:40,816 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:39:40,817 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 55 treesize of output 26 [2023-02-15 01:39:40,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:39:40,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:39:40,995 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2500 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_2500) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2504 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2504))) (exists ((v_ArrVal_2503 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2503) |c_#memory_$Pointer$.offset|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 01:39:41,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:41,029 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 01:39:41,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:41,044 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:39:41,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 55 [2023-02-15 01:39:41,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:41,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 18 [2023-02-15 01:39:41,058 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 01:39:41,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 01:39:41,161 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 01:39:41,346 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 15 not checked. [2023-02-15 01:39:41,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:39:42,003 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2505 (Array Int Int)) (v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2514 (Array Int Int)) (|v_node_create_~temp~0#1.base_43| Int) (v_ArrVal_2516 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_43| v_ArrVal_2515))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_43|) 0)) (< (select (store |c_#length| |v_node_create_~temp~0#1.base_43| v_ArrVal_2516) (select (select (store .cse0 .cse1 v_ArrVal_2505) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 8) (not (< |v_node_create_~temp~0#1.base_43| |c_#StackHeapBarrier|)) (not (= (select (select .cse0 .cse1) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_43| v_ArrVal_2514) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4)) 0)))))) is different from false [2023-02-15 01:39:42,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208876298] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:42,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:39:42,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 47 [2023-02-15 01:39:42,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607809707] [2023-02-15 01:39:42,005 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:39:42,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-02-15 01:39:42,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:39:42,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-02-15 01:39:42,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2624, Unknown=13, NotChecked=420, Total=3192 [2023-02-15 01:39:42,007 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand has 47 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 41 states have internal predecessors, (97), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 01:39:45,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:39:45,403 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2023-02-15 01:39:45,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 01:39:45,403 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 41 states have internal predecessors, (97), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 56 [2023-02-15 01:39:45,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:39:45,404 INFO L225 Difference]: With dead ends: 104 [2023-02-15 01:39:45,404 INFO L226 Difference]: Without dead ends: 104 [2023-02-15 01:39:45,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=462, Invalid=4941, Unknown=15, NotChecked=588, Total=6006 [2023-02-15 01:39:45,406 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 334 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 26 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 1971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 274 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:39:45,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 923 Invalid, 1971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1668 Invalid, 3 Unknown, 274 Unchecked, 1.0s Time] [2023-02-15 01:39:45,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-15 01:39:45,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2023-02-15 01:39:45,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 85 states have internal predecessors, (91), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 01:39:45,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2023-02-15 01:39:45,409 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 56 [2023-02-15 01:39:45,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:39:45,409 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2023-02-15 01:39:45,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 41 states have internal predecessors, (97), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 01:39:45,409 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2023-02-15 01:39:45,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-15 01:39:45,410 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:39:45,410 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:39:45,421 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 01:39:45,619 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,SelfDestructingSolverStorable20 [2023-02-15 01:39:45,619 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 01:39:45,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:39:45,620 INFO L85 PathProgramCache]: Analyzing trace with hash 294390785, now seen corresponding path program 1 times [2023-02-15 01:39:45,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:39:45,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745225035] [2023-02-15 01:39:45,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:45,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:39:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:46,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:39:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:46,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:39:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:46,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:39:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:46,427 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 01:39:46,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:39:46,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745225035] [2023-02-15 01:39:46,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745225035] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:46,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799495490] [2023-02-15 01:39:46,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:46,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:39:46,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:39:46,433 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 01:39:46,447 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 01:39:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:46,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 87 conjunts are in the unsatisfiable core [2023-02-15 01:39:46,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:39:46,821 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 01:39:46,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:39:47,191 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:39:47,191 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 21 treesize of output 12 [2023-02-15 01:39:47,194 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 7 treesize of output 3 [2023-02-15 01:39:47,351 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2686 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2686))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_2690 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2690) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2689 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2689))))) is different from true [2023-02-15 01:39:47,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:47,388 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:39:47,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2023-02-15 01:39:47,407 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-15 01:39:47,407 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 21 treesize of output 29 [2023-02-15 01:39:47,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:47,412 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 01:39:47,502 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 01:39:47,723 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-15 01:39:47,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 44 [2023-02-15 01:39:47,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-02-15 01:39:47,780 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:39:47,780 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 40 treesize of output 23 [2023-02-15 01:39:47,784 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2023-02-15 01:39:47,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:39:47,793 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2691 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2691) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2023-02-15 01:39:47,852 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2691 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)) v_ArrVal_2691) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2023-02-15 01:39:47,914 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2691 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4)) v_ArrVal_2691) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2023-02-15 01:39:48,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799495490] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:48,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:39:48,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 50 [2023-02-15 01:39:48,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315427527] [2023-02-15 01:39:48,027 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:39:48,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-02-15 01:39:48,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:39:48,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-02-15 01:39:48,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2543, Unknown=33, NotChecked=420, Total=3192 [2023-02-15 01:39:48,030 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 51 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 46 states have internal predecessors, (95), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 01:39:50,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:39:50,666 INFO L93 Difference]: Finished difference Result 176 states and 194 transitions. [2023-02-15 01:39:50,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-02-15 01:39:50,668 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 46 states have internal predecessors, (95), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 56 [2023-02-15 01:39:50,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:39:50,669 INFO L225 Difference]: With dead ends: 176 [2023-02-15 01:39:50,669 INFO L226 Difference]: Without dead ends: 176 [2023-02-15 01:39:50,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1481 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=880, Invalid=6072, Unknown=36, NotChecked=668, Total=7656 [2023-02-15 01:39:50,671 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 1284 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 35 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1284 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 01:39:50,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1284 Valid, 841 Invalid, 1637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1493 Invalid, 3 Unknown, 106 Unchecked, 0.7s Time] [2023-02-15 01:39:50,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-02-15 01:39:50,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 94. [2023-02-15 01:39:50,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 76 states have (on average 1.25) internal successors, (95), 87 states have internal predecessors, (95), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 01:39:50,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2023-02-15 01:39:50,674 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 56 [2023-02-15 01:39:50,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:39:50,674 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2023-02-15 01:39:50,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 46 states have internal predecessors, (95), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 01:39:50,675 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2023-02-15 01:39:50,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-15 01:39:50,675 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:39:50,675 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:39:50,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-15 01:39:50,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-02-15 01:39:50,877 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 01:39:50,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:39:50,877 INFO L85 PathProgramCache]: Analyzing trace with hash 294390786, now seen corresponding path program 1 times [2023-02-15 01:39:50,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:39:50,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32958435] [2023-02-15 01:39:50,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:50,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:39:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:52,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:39:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:52,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:39:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:52,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:39:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:52,906 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:39:52,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:39:52,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32958435] [2023-02-15 01:39:52,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32958435] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:52,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444488619] [2023-02-15 01:39:52,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:39:52,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:39:52,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:39:52,908 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:39:52,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-15 01:39:53,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:39:53,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 105 conjunts are in the unsatisfiable core [2023-02-15 01:39:53,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:39:53,126 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 01:39:53,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:39:53,241 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:39:53,241 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 01:39:53,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:39:53,709 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:39:53,709 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 30 treesize of output 17 [2023-02-15 01:39:53,713 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 7 treesize of output 3 [2023-02-15 01:39:53,866 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2874 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2874))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_2875 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2875) |c_#memory_$Pointer$.offset|)))) is different from true [2023-02-15 01:39:53,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:53,902 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:39:53,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 40 [2023-02-15 01:39:53,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:39:53,910 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 01:39:53,919 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 01:39:53,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 01:39:54,433 INFO L321 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2023-02-15 01:39:54,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 120 treesize of output 105 [2023-02-15 01:39:54,445 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-02-15 01:39:54,445 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 75 [2023-02-15 01:39:54,466 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:39:54,474 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 01:39:54,474 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 32 [2023-02-15 01:39:54,574 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:39:54,575 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 52 treesize of output 31 [2023-02-15 01:39:54,579 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 26 treesize of output 14 [2023-02-15 01:39:54,681 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-15 01:39:54,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:39:54,834 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (and (forall ((v_ArrVal_2878 Int)) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store .cse0 .cse1 v_ArrVal_2878)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_2877 (Array Int Int)) (v_ArrVal_2878 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store .cse0 .cse1 v_ArrVal_2878)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2877) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-02-15 01:39:55,377 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:39:55,379 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 121 treesize of output 125 [2023-02-15 01:39:56,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444488619] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:39:56,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:39:56,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 60 [2023-02-15 01:39:56,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329592899] [2023-02-15 01:39:56,423 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:39:56,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-02-15 01:39:56,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:39:56,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-02-15 01:39:56,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=4715, Unknown=10, NotChecked=278, Total=5256 [2023-02-15 01:39:56,426 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand has 61 states, 58 states have (on average 1.706896551724138) internal successors, (99), 54 states have internal predecessors, (99), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:40:00,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:40:00,475 INFO L93 Difference]: Finished difference Result 162 states and 177 transitions. [2023-02-15 01:40:00,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-02-15 01:40:00,476 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 58 states have (on average 1.706896551724138) internal successors, (99), 54 states have internal predecessors, (99), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 56 [2023-02-15 01:40:00,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:40:00,477 INFO L225 Difference]: With dead ends: 162 [2023-02-15 01:40:00,477 INFO L226 Difference]: Without dead ends: 162 [2023-02-15 01:40:00,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2563 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=957, Invalid=9547, Unknown=10, NotChecked=406, Total=10920 [2023-02-15 01:40:00,478 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 1262 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 01:40:00,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1262 Valid, 747 Invalid, 1831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1674 Invalid, 0 Unknown, 119 Unchecked, 0.9s Time] [2023-02-15 01:40:00,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-15 01:40:00,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 96. [2023-02-15 01:40:00,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 78 states have (on average 1.2179487179487178) internal successors, (95), 89 states have internal predecessors, (95), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 01:40:00,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2023-02-15 01:40:00,482 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 56 [2023-02-15 01:40:00,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:40:00,482 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2023-02-15 01:40:00,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 58 states have (on average 1.706896551724138) internal successors, (99), 54 states have internal predecessors, (99), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:40:00,483 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2023-02-15 01:40:00,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-15 01:40:00,484 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:40:00,484 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2023-02-15 01:40:00,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-15 01:40:00,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:40:00,689 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 01:40:00,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:40:00,689 INFO L85 PathProgramCache]: Analyzing trace with hash 348951848, now seen corresponding path program 1 times [2023-02-15 01:40:00,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:40:00,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833759514] [2023-02-15 01:40:00,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:40:00,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:40:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:02,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:40:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:02,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:40:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:02,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:40:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:03,515 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:40:03,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:40:03,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833759514] [2023-02-15 01:40:03,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833759514] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:40:03,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3196030] [2023-02-15 01:40:03,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:40:03,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:40:03,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:40:03,517 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:40:03,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-15 01:40:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:03,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 128 conjunts are in the unsatisfiable core [2023-02-15 01:40:03,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:40:04,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:40:04,147 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 01:40:04,269 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:40:04,269 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 01:40:04,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:40:04,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:04,427 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 21 treesize of output 20 [2023-02-15 01:40:04,768 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:40:04,769 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 69 treesize of output 32 [2023-02-15 01:40:04,773 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 7 treesize of output 3 [2023-02-15 01:40:04,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-02-15 01:40:04,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:40:04,969 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_3065 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3065))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_3064 (Array Int Int))) (= (store |c_old(#memory_int)| |node_create_~temp~0#1.base| v_ArrVal_3064) |c_#memory_int|)) (exists ((v_ArrVal_3063 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3063) |c_#memory_$Pointer$.base|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 01:40:04,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:05,003 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:40:05,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 65 [2023-02-15 01:40:05,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:05,013 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 18 treesize of output 20 [2023-02-15 01:40:05,028 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 01:40:05,029 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 28 treesize of output 30 [2023-02-15 01:40:05,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:05,033 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 14 treesize of output 16 [2023-02-15 01:40:05,690 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-15 01:40:05,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 153 treesize of output 112 [2023-02-15 01:40:05,707 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-02-15 01:40:05,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 49 [2023-02-15 01:40:05,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:05,712 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 32 treesize of output 34 [2023-02-15 01:40:05,796 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:40:05,796 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 56 treesize of output 27 [2023-02-15 01:40:05,808 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 01:40:05,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:40:05,968 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-15 01:40:05,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:40:06,101 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3066 (Array Int Int)) (v_ArrVal_3068 (Array Int Int)) (v_ArrVal_3067 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_3066) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_3068) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4) v_ArrVal_3067)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-15 01:40:06,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3196030] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:40:06,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:40:06,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2023-02-15 01:40:06,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594198452] [2023-02-15 01:40:06,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:40:06,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-02-15 01:40:06,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:40:06,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-02-15 01:40:06,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=5295, Unknown=3, NotChecked=294, Total=5852 [2023-02-15 01:40:06,987 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 66 states, 64 states have (on average 1.65625) internal successors, (106), 58 states have internal predecessors, (106), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:40:14,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:40:14,683 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2023-02-15 01:40:14,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-02-15 01:40:14,683 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 64 states have (on average 1.65625) internal successors, (106), 58 states have internal predecessors, (106), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 60 [2023-02-15 01:40:14,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:40:14,684 INFO L225 Difference]: With dead ends: 157 [2023-02-15 01:40:14,684 INFO L226 Difference]: Without dead ends: 157 [2023-02-15 01:40:14,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2621 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=1115, Invalid=10662, Unknown=3, NotChecked=430, Total=12210 [2023-02-15 01:40:14,685 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1256 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 2052 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1256 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 2185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:40:14,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1256 Valid, 1063 Invalid, 2185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2052 Invalid, 0 Unknown, 80 Unchecked, 1.2s Time] [2023-02-15 01:40:14,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-02-15 01:40:14,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 106. [2023-02-15 01:40:14,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 88 states have (on average 1.2045454545454546) internal successors, (106), 99 states have internal predecessors, (106), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 01:40:14,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2023-02-15 01:40:14,689 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 60 [2023-02-15 01:40:14,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:40:14,689 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2023-02-15 01:40:14,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 64 states have (on average 1.65625) internal successors, (106), 58 states have internal predecessors, (106), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:40:14,690 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2023-02-15 01:40:14,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-15 01:40:14,690 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:40:14,691 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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 01:40:14,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-02-15 01:40:14,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:40:14,897 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 01:40:14,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:40:14,898 INFO L85 PathProgramCache]: Analyzing trace with hash -2067394117, now seen corresponding path program 1 times [2023-02-15 01:40:14,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:40:14,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637798723] [2023-02-15 01:40:14,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:40:14,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:40:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:16,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:40:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:16,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:40:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:16,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:40:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:17,398 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:40:17,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:40:17,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637798723] [2023-02-15 01:40:17,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637798723] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:40:17,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630482528] [2023-02-15 01:40:17,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:40:17,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:40:17,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:40:17,399 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:40:17,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-15 01:40:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:17,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 115 conjunts are in the unsatisfiable core [2023-02-15 01:40:17,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:40:17,642 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 01:40:17,646 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 01:40:17,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:40:17,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:40:17,865 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:40:17,865 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 12 treesize of output 18 [2023-02-15 01:40:17,877 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:40:17,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 01:40:18,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:40:18,309 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:40:18,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 01:40:18,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:18,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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 01:40:18,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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 01:40:18,867 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:40:18,867 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 78 treesize of output 33 [2023-02-15 01:40:18,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2023-02-15 01:40:18,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:40:18,878 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 7 treesize of output 3 [2023-02-15 01:40:19,089 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_3255 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_3255) |c_#length|)) (exists ((v_ArrVal_3260 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3260))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_3259 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3259) |c_#memory_$Pointer$.offset|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2023-02-15 01:40:19,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:19,129 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:40:19,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 68 [2023-02-15 01:40:19,158 INFO L321 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2023-02-15 01:40:19,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 57 [2023-02-15 01:40:19,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:19,165 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 14 treesize of output 16 [2023-02-15 01:40:19,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:19,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:40:19,532 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:40:19,533 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 13 treesize of output 17 [2023-02-15 01:40:19,824 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2023-02-15 01:40:19,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 78 [2023-02-15 01:40:19,844 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 01:40:19,970 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 01:40:20,191 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:40:20,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:20,196 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:40:20,196 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 3 case distinctions, treesize of input 113 treesize of output 49 [2023-02-15 01:40:20,561 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2023-02-15 01:40:20,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:40:22,749 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3263 Int) (v_ArrVal_3264 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse1 v_ArrVal_3263)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse1 v_ArrVal_3264)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 .cse2))) 1) (<= (+ .cse2 1) 0))))) is different from false [2023-02-15 01:40:23,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630482528] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:40:23,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:40:23,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 31] total 67 [2023-02-15 01:40:23,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84504118] [2023-02-15 01:40:23,333 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:40:23,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-02-15 01:40:23,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:40:23,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-02-15 01:40:23,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=4869, Unknown=3, NotChecked=282, Total=5402 [2023-02-15 01:40:23,334 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 68 states, 65 states have (on average 1.676923076923077) internal successors, (109), 60 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:40:37,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:40:37,068 INFO L93 Difference]: Finished difference Result 170 states and 182 transitions. [2023-02-15 01:40:37,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-02-15 01:40:37,068 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 65 states have (on average 1.676923076923077) internal successors, (109), 60 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 61 [2023-02-15 01:40:37,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:40:37,069 INFO L225 Difference]: With dead ends: 170 [2023-02-15 01:40:37,069 INFO L226 Difference]: Without dead ends: 170 [2023-02-15 01:40:37,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2829 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=1466, Invalid=11193, Unknown=5, NotChecked=446, Total=13110 [2023-02-15 01:40:37,071 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1629 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 2096 mSolverCounterSat, 58 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1629 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 2288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2096 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 131 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-02-15 01:40:37,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1629 Valid, 868 Invalid, 2288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2096 Invalid, 3 Unknown, 131 Unchecked, 1.7s Time] [2023-02-15 01:40:37,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-02-15 01:40:37,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 109. [2023-02-15 01:40:37,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 102 states have internal predecessors, (111), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 01:40:37,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2023-02-15 01:40:37,076 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 61 [2023-02-15 01:40:37,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:40:37,076 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2023-02-15 01:40:37,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 65 states have (on average 1.676923076923077) internal successors, (109), 60 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:40:37,077 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2023-02-15 01:40:37,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-15 01:40:37,077 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:40:37,077 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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 01:40:37,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-02-15 01:40:37,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-02-15 01:40:37,278 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 01:40:37,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:40:37,278 INFO L85 PathProgramCache]: Analyzing trace with hash -2067394116, now seen corresponding path program 1 times [2023-02-15 01:40:37,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:40:37,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191550721] [2023-02-15 01:40:37,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:40:37,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:40:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:38,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:40:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:38,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:40:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:39,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:40:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:39,529 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:40:39,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:40:39,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191550721] [2023-02-15 01:40:39,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191550721] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:40:39,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842053799] [2023-02-15 01:40:39,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:40:39,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:40:39,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:40:39,539 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:40:39,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-15 01:40:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:40:39,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 133 conjunts are in the unsatisfiable core [2023-02-15 01:40:39,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:40:39,785 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 01:40:39,791 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 01:40:39,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:40:39,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:40:40,074 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:40:40,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 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-15 01:40:40,095 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:40:40,095 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 01:40:40,439 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:40:40,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-02-15 01:40:40,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:40:40,650 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-02-15 01:40:40,650 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 5 case distinctions, treesize of input 22 treesize of output 33 [2023-02-15 01:40:40,673 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 01:40:40,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 24 treesize of output 27 [2023-02-15 01:40:40,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:40:40,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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 01:40:41,415 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:40:41,415 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 104 treesize of output 47 [2023-02-15 01:40:41,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:41,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 16 treesize of output 10 [2023-02-15 01:40:41,435 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:40:41,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-02-15 01:40:41,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:40:41,736 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_3457 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3457))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_3456 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3456))) (exists ((v_ArrVal_3453 Int)) (and (<= 8 v_ArrVal_3453) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_3453) |c_#length|))))) is different from true [2023-02-15 01:40:41,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:41,792 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:40:41,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 84 [2023-02-15 01:40:41,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:41,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:41,807 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 01:40:41,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:41,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:41,819 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-15 01:40:41,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 38 treesize of output 33 [2023-02-15 01:40:41,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:41,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:41,846 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 01:40:41,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-02-15 01:40:42,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:42,587 INFO L321 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2023-02-15 01:40:42,587 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 1 case distinctions, treesize of input 32 treesize of output 34 [2023-02-15 01:40:42,620 INFO L321 Elim1Store]: treesize reduction 65, result has 30.1 percent of original size [2023-02-15 01:40:42,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 124 treesize of output 84 [2023-02-15 01:40:43,093 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:40:43,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:40:43,097 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:40:43,097 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 3 case distinctions, treesize of input 128 treesize of output 60 [2023-02-15 01:40:43,106 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 01:40:43,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 16 [2023-02-15 01:40:43,516 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2023-02-15 01:40:43,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:40:45,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842053799] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:40:45,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:40:45,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 30] total 66 [2023-02-15 01:40:45,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473063496] [2023-02-15 01:40:45,706 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:40:45,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2023-02-15 01:40:45,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:40:45,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2023-02-15 01:40:45,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=5584, Unknown=9, NotChecked=150, Total=6006 [2023-02-15 01:40:45,708 INFO L87 Difference]: Start difference. First operand 109 states and 121 transitions. Second operand has 67 states, 64 states have (on average 1.703125) internal successors, (109), 59 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:41:05,495 WARN L233 SmtUtils]: Spent 5.28s on a formula simplification. DAG size of input: 197 DAG size of output: 173 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 01:41:23,330 WARN L233 SmtUtils]: Spent 5.34s on a formula simplification. DAG size of input: 182 DAG size of output: 165 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 01:41:28,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:41:28,106 INFO L93 Difference]: Finished difference Result 174 states and 189 transitions. [2023-02-15 01:41:28,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-02-15 01:41:28,106 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 64 states have (on average 1.703125) internal successors, (109), 59 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 61 [2023-02-15 01:41:28,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:41:28,107 INFO L225 Difference]: With dead ends: 174 [2023-02-15 01:41:28,107 INFO L226 Difference]: Without dead ends: 174 [2023-02-15 01:41:28,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2553 ImplicationChecksByTransitivity, 44.6s TimeCoverageRelationStatistics Valid=1381, Invalid=12183, Unknown=12, NotChecked=230, Total=13806 [2023-02-15 01:41:28,109 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1352 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 2392 mSolverCounterSat, 42 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1352 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 2563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2392 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-02-15 01:41:28,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1352 Valid, 983 Invalid, 2563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2392 Invalid, 3 Unknown, 126 Unchecked, 2.8s Time] [2023-02-15 01:41:28,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-02-15 01:41:28,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 111. [2023-02-15 01:41:28,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 93 states have (on average 1.2043010752688172) internal successors, (112), 104 states have internal predecessors, (112), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 01:41:28,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2023-02-15 01:41:28,113 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 61 [2023-02-15 01:41:28,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:41:28,113 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2023-02-15 01:41:28,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 64 states have (on average 1.703125) internal successors, (109), 59 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:41:28,114 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2023-02-15 01:41:28,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-15 01:41:28,114 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:41:28,114 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:41:28,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-02-15 01:41:28,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-02-15 01:41:28,321 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 01:41:28,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:41:28,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1413927454, now seen corresponding path program 1 times [2023-02-15 01:41:28,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:41:28,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608860345] [2023-02-15 01:41:28,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:28,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:41:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:30,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:41:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:30,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:41:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:30,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:41:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:31,729 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:41:31,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:41:31,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608860345] [2023-02-15 01:41:31,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608860345] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:41:31,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049891082] [2023-02-15 01:41:31,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:31,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:41:31,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:41:31,731 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:41:31,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-15 01:41:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:31,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 173 conjunts are in the unsatisfiable core [2023-02-15 01:41:31,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:41:31,990 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 01:41:32,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:41:32,197 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 01:41:32,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:32,352 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 01:41:32,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:32,524 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 01:41:32,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:41:32,724 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 7 treesize of output 3 [2023-02-15 01:41:32,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:41:33,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:33,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-02-15 01:41:33,225 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:41:33,226 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 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 01:41:33,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:41:33,248 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 01:41:33,248 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 01:41:33,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:41:33,499 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 20 treesize of output 22 [2023-02-15 01:41:33,506 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 13 treesize of output 9 [2023-02-15 01:41:34,103 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:41:34,104 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 91 treesize of output 42 [2023-02-15 01:41:34,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:34,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2023-02-15 01:41:34,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:41:34,120 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 7 treesize of output 3 [2023-02-15 01:41:34,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:41:34,398 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_3660 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3660) |c_#memory_$Pointer$.base|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_3659 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3659) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3654 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_3654) |c_#length|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_3658 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |node_create_~temp~0#1.base| v_ArrVal_3658))))) is different from true [2023-02-15 01:41:34,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:34,451 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:41:34,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 81 [2023-02-15 01:41:34,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:34,469 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 22 treesize of output 24 [2023-02-15 01:41:34,487 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 01:41:34,487 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 28 treesize of output 30 [2023-02-15 01:41:34,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:34,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:34,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 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 01:41:34,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:34,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:41:35,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:35,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:41:35,656 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2023-02-15 01:41:35,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 224 treesize of output 175 [2023-02-15 01:41:35,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:35,688 INFO L321 Elim1Store]: treesize reduction 112, result has 16.4 percent of original size [2023-02-15 01:41:35,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 172 treesize of output 116 [2023-02-15 01:41:35,694 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:41:35,694 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 55 treesize of output 40 [2023-02-15 01:41:36,177 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:41:36,177 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:41:36,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:36,184 INFO L321 Elim1Store]: treesize reduction 3, result has 70.0 percent of original size [2023-02-15 01:41:36,185 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 6 case distinctions, treesize of input 105 treesize of output 54 [2023-02-15 01:41:36,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:41:36,194 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 01:41:36,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 16 [2023-02-15 01:41:36,541 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:41:36,543 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:41:36,543 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 15 treesize of output 10 [2023-02-15 01:41:36,625 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-15 01:41:36,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:41:37,662 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_23| Int) (v_ArrVal_3663 (Array Int Int)) (v_ArrVal_3661 Int) (v_ArrVal_3662 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 v_ArrVal_3662)))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_3663))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ .cse4 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse0 v_ArrVal_3661)) (select (select .cse1 .cse2) .cse3)) |v_ULTIMATE.start_main_~ptr~0#1.offset_23|)) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_23|)) (not (<= 0 .cse4)) (< (select (select .cse5 .cse2) .cse3) |v_ULTIMATE.start_main_~ptr~0#1.offset_23|))))))) is different from false [2023-02-15 01:41:40,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049891082] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:41:40,649 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:41:40,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 77 [2023-02-15 01:41:40,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349630535] [2023-02-15 01:41:40,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:41:40,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2023-02-15 01:41:40,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:41:40,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2023-02-15 01:41:40,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=7737, Unknown=13, NotChecked=354, Total=8372 [2023-02-15 01:41:40,650 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand has 77 states, 75 states have (on average 1.5466666666666666) internal successors, (116), 69 states have internal predecessors, (116), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:41:59,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:41:59,490 INFO L93 Difference]: Finished difference Result 167 states and 183 transitions. [2023-02-15 01:41:59,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-02-15 01:41:59,491 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 75 states have (on average 1.5466666666666666) internal successors, (116), 69 states have internal predecessors, (116), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 65 [2023-02-15 01:41:59,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:41:59,493 INFO L225 Difference]: With dead ends: 167 [2023-02-15 01:41:59,493 INFO L226 Difference]: Without dead ends: 167 [2023-02-15 01:41:59,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 124 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1970 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=1201, Invalid=14043, Unknown=16, NotChecked=490, Total=15750 [2023-02-15 01:41:59,497 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 1355 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 3732 mSolverCounterSat, 65 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 3917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3732 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:41:59,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1355 Valid, 1418 Invalid, 3917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3732 Invalid, 5 Unknown, 115 Unchecked, 3.3s Time] [2023-02-15 01:41:59,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-02-15 01:41:59,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 116. [2023-02-15 01:41:59,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 98 states have (on average 1.1938775510204083) internal successors, (117), 109 states have internal predecessors, (117), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 01:41:59,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2023-02-15 01:41:59,507 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 65 [2023-02-15 01:41:59,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:41:59,508 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2023-02-15 01:41:59,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 75 states have (on average 1.5466666666666666) internal successors, (116), 69 states have internal predecessors, (116), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:41:59,508 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2023-02-15 01:41:59,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-15 01:41:59,509 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:41:59,509 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:41:59,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-02-15 01:41:59,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-02-15 01:41:59,719 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 01:41:59,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:41:59,719 INFO L85 PathProgramCache]: Analyzing trace with hash -655878667, now seen corresponding path program 3 times [2023-02-15 01:41:59,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:41:59,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007652964] [2023-02-15 01:41:59,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:41:59,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:41:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:59,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:41:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:59,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:41:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:59,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-15 01:41:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:59,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-02-15 01:41:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:41:59,817 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-02-15 01:41:59,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:41:59,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007652964] [2023-02-15 01:41:59,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007652964] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:41:59,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400321143] [2023-02-15 01:41:59,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 01:41:59,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:41:59,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:41:59,819 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:41:59,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-02-15 01:42:00,379 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-15 01:42:00,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 01:42:00,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 01:42:00,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:42:00,405 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-02-15 01:42:00,406 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:42:00,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400321143] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:42:00,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 01:42:00,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2023-02-15 01:42:00,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110362549] [2023-02-15 01:42:00,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:42:00,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:42:00,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:42:00,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:42:00,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:42:00,410 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 01:42:00,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:42:00,426 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2023-02-15 01:42:00,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:42:00,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 66 [2023-02-15 01:42:00,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:42:00,427 INFO L225 Difference]: With dead ends: 77 [2023-02-15 01:42:00,427 INFO L226 Difference]: Without dead ends: 77 [2023-02-15 01:42:00,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:42:00,428 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 138 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:42:00,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 81 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:42:00,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-15 01:42:00,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-02-15 01:42:00,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 63 states have (on average 1.1904761904761905) internal successors, (75), 72 states have internal predecessors, (75), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:42:00,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2023-02-15 01:42:00,433 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 66 [2023-02-15 01:42:00,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:42:00,433 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2023-02-15 01:42:00,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 01:42:00,433 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2023-02-15 01:42:00,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-15 01:42:00,436 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:42:00,436 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:42:00,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-02-15 01:42:00,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:42:00,644 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 01:42:00,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:42:00,644 INFO L85 PathProgramCache]: Analyzing trace with hash -882077631, now seen corresponding path program 2 times [2023-02-15 01:42:00,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:42:00,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683758407] [2023-02-15 01:42:00,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:42:00,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:42:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:42:03,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 01:42:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:42:03,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 01:42:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:42:03,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 01:42:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:42:04,263 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:42:04,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:42:04,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683758407] [2023-02-15 01:42:04,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683758407] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:42:04,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000832419] [2023-02-15 01:42:04,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 01:42:04,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:42:04,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:42:04,265 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:42:04,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-02-15 01:42:04,563 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 01:42:04,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 01:42:04,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 159 conjunts are in the unsatisfiable core [2023-02-15 01:42:04,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:42:04,613 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 01:42:04,677 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:42:04,678 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 01:42:04,885 INFO L321 Elim1Store]: treesize reduction 26, result has 27.8 percent of original size [2023-02-15 01:42:04,886 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 3 case distinctions, treesize of input 22 treesize of output 29 [2023-02-15 01:42:05,152 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-02-15 01:42:05,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 01:42:05,236 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 13 treesize of output 9 [2023-02-15 01:42:05,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:42:05,316 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 21 treesize of output 20 [2023-02-15 01:42:05,430 INFO L321 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2023-02-15 01:42:05,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 41 [2023-02-15 01:42:05,638 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 23 treesize of output 13 [2023-02-15 01:42:06,060 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:42:06,060 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 59 treesize of output 26 [2023-02-15 01:42:06,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-02-15 01:42:06,080 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-02-15 01:42:06,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 21 treesize of output 25 [2023-02-15 01:42:06,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:42:06,542 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:42:06,542 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 65 treesize of output 55 [2023-02-15 01:42:06,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:42:06,581 INFO L321 Elim1Store]: treesize reduction 108, result has 28.5 percent of original size [2023-02-15 01:42:06,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 44 treesize of output 73 [2023-02-15 01:42:06,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:42:06,612 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 14 treesize of output 16 [2023-02-15 01:42:07,602 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:42:07,623 INFO L321 Elim1Store]: treesize reduction 97, result has 19.8 percent of original size [2023-02-15 01:42:07,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 154 treesize of output 88 [2023-02-15 01:42:07,640 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-15 01:42:07,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 259 treesize of output 223 [2023-02-15 01:42:08,165 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-15 01:42:08,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 259 treesize of output 161 [2023-02-15 01:42:08,791 INFO L321 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2023-02-15 01:42:08,791 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 50 [2023-02-15 01:42:09,234 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:42:09,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:42:11,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000832419] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:42:11,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:42:11,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 37] total 80 [2023-02-15 01:42:11,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859049781] [2023-02-15 01:42:11,041 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:42:11,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2023-02-15 01:42:11,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:42:11,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2023-02-15 01:42:11,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=8816, Unknown=4, NotChecked=0, Total=9120 [2023-02-15 01:42:11,043 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 81 states, 78 states have (on average 1.5384615384615385) internal successors, (120), 72 states have internal predecessors, (120), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:42:29,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:42:29,259 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2023-02-15 01:42:29,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-02-15 01:42:29,259 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 78 states have (on average 1.5384615384615385) internal successors, (120), 72 states have internal predecessors, (120), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 66 [2023-02-15 01:42:29,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:42:29,260 INFO L225 Difference]: With dead ends: 100 [2023-02-15 01:42:29,260 INFO L226 Difference]: Without dead ends: 100 [2023-02-15 01:42:29,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3359 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=1389, Invalid=15898, Unknown=5, NotChecked=0, Total=17292 [2023-02-15 01:42:29,261 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 1126 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 3108 mSolverCounterSat, 49 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 3159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 3108 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-02-15 01:42:29,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1126 Valid, 1029 Invalid, 3159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 3108 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2023-02-15 01:42:29,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-15 01:42:29,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 79. [2023-02-15 01:42:29,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.2) internal successors, (78), 74 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:42:29,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2023-02-15 01:42:29,264 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 66 [2023-02-15 01:42:29,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:42:29,264 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2023-02-15 01:42:29,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 78 states have (on average 1.5384615384615385) internal successors, (120), 72 states have internal predecessors, (120), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:42:29,265 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2023-02-15 01:42:29,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-15 01:42:29,265 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:42:29,265 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:42:29,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-02-15 01:42:29,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-02-15 01:42:29,474 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2023-02-15 01:42:29,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:42:29,474 INFO L85 PathProgramCache]: Analyzing trace with hash -882077630, now seen corresponding path program 2 times [2023-02-15 01:42:29,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:42:29,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902268987] [2023-02-15 01:42:29,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:42:29,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:42:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat