./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 2329fc70 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-?-2329fc7 [2023-02-14 02:21:23,958 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 02:21:23,960 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 02:21:23,995 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 02:21:23,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 02:21:23,997 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 02:21:23,998 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 02:21:24,001 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 02:21:24,003 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 02:21:24,004 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 02:21:24,005 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 02:21:24,006 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 02:21:24,007 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 02:21:24,009 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 02:21:24,011 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 02:21:24,012 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 02:21:24,014 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 02:21:24,017 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 02:21:24,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 02:21:24,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 02:21:24,023 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 02:21:24,025 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 02:21:24,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 02:21:24,026 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 02:21:24,028 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 02:21:24,031 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 02:21:24,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 02:21:24,032 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 02:21:24,033 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 02:21:24,034 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 02:21:24,035 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 02:21:24,035 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 02:21:24,036 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 02:21:24,037 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 02:21:24,045 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 02:21:24,046 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 02:21:24,047 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 02:21:24,047 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 02:21:24,047 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 02:21:24,048 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 02:21:24,049 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 02:21:24,050 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-14 02:21:24,079 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 02:21:24,079 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 02:21:24,079 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 02:21:24,080 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 02:21:24,080 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 02:21:24,080 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 02:21:24,081 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 02:21:24,081 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 02:21:24,081 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 02:21:24,082 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 02:21:24,082 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 02:21:24,082 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 02:21:24,083 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 02:21:24,083 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 02:21:24,083 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 02:21:24,083 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 02:21:24,083 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 02:21:24,083 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 02:21:24,083 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 02:21:24,083 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 02:21:24,084 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 02:21:24,084 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 02:21:24,084 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 02:21:24,084 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 02:21:24,084 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 02:21:24,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 02:21:24,084 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 02:21:24,085 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 02:21:24,085 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 02:21:24,085 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 02:21:24,085 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 02:21:24,085 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 02:21:24,086 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 02:21:24,086 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 02:21:24,086 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-14 02:21:24,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 02:21:24,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 02:21:24,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 02:21:24,329 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 02:21:24,329 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 02:21:24,330 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-14 02:21:25,405 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 02:21:25,645 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 02:21:25,646 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_equal.i [2023-02-14 02:21:25,656 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac30bd7c5/29c38933a544443895f48c53566ea1c6/FLAGa7235bffd [2023-02-14 02:21:25,979 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac30bd7c5/29c38933a544443895f48c53566ea1c6 [2023-02-14 02:21:25,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 02:21:25,983 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 02:21:25,987 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 02:21:25,987 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 02:21:25,990 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 02:21:25,991 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 02:21:25" (1/1) ... [2023-02-14 02:21:25,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e8425c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:21:25, skipping insertion in model container [2023-02-14 02:21:25,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 02:21:25" (1/1) ... [2023-02-14 02:21:25,999 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 02:21:26,038 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 02:21:26,309 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-14 02:21:26,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 02:21:26,326 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 02:21:26,364 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-14 02:21:26,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 02:21:26,407 INFO L208 MainTranslator]: Completed translation [2023-02-14 02:21:26,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:21:26 WrapperNode [2023-02-14 02:21:26,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 02:21:26,439 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 02:21:26,439 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 02:21:26,439 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 02:21:26,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:21:26" (1/1) ... [2023-02-14 02:21:26,456 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:21:26" (1/1) ... [2023-02-14 02:21:26,483 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 121 [2023-02-14 02:21:26,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 02:21:26,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 02:21:26,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 02:21:26,489 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 02:21:26,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:21:26" (1/1) ... [2023-02-14 02:21:26,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:21:26" (1/1) ... [2023-02-14 02:21:26,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:21:26" (1/1) ... [2023-02-14 02:21:26,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:21:26" (1/1) ... [2023-02-14 02:21:26,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:21:26" (1/1) ... [2023-02-14 02:21:26,515 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:21:26" (1/1) ... [2023-02-14 02:21:26,516 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:21:26" (1/1) ... [2023-02-14 02:21:26,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:21:26" (1/1) ... [2023-02-14 02:21:26,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 02:21:26,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 02:21:26,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 02:21:26,526 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 02:21:26,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:21:26" (1/1) ... [2023-02-14 02:21:26,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 02:21:26,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:21:26,560 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-14 02:21:26,563 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-14 02:21:26,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-14 02:21:26,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-14 02:21:26,598 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-14 02:21:26,598 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-14 02:21:26,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 02:21:26,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 02:21:26,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-14 02:21:26,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-14 02:21:26,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-14 02:21:26,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 02:21:26,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-14 02:21:26,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 02:21:26,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 02:21:26,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 02:21:26,689 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 02:21:26,690 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 02:21:26,928 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 02:21:26,932 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 02:21:26,933 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-14 02:21:26,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:21:26 BoogieIcfgContainer [2023-02-14 02:21:26,934 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 02:21:26,935 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 02:21:26,936 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 02:21:26,938 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 02:21:26,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 02:21:25" (1/3) ... [2023-02-14 02:21:26,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37067492 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 02:21:26, skipping insertion in model container [2023-02-14 02:21:26,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:21:26" (2/3) ... [2023-02-14 02:21:26,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37067492 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 02:21:26, skipping insertion in model container [2023-02-14 02:21:26,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:21:26" (3/3) ... [2023-02-14 02:21:26,940 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2023-02-14 02:21:26,952 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 02:21:26,952 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2023-02-14 02:21:26,990 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 02:21:26,997 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;@3d4c8b2d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 02:21:26,997 INFO L358 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2023-02-14 02:21:27,001 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-14 02:21:27,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-14 02:21:27,005 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:21:27,005 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:21:27,006 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-14 02:21:27,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:21:27,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1813904761, now seen corresponding path program 1 times [2023-02-14 02:21:27,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:21:27,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937253523] [2023-02-14 02:21:27,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:21:27,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:21:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:27,236 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-14 02:21:27,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:21:27,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937253523] [2023-02-14 02:21:27,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937253523] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:21:27,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:21:27,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 02:21:27,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151541117] [2023-02-14 02:21:27,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:21:27,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:21:27,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:21:27,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:21:27,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:21:27,273 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-14 02:21:27,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:21:27,354 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2023-02-14 02:21:27,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:21:27,356 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-14 02:21:27,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:21:27,363 INFO L225 Difference]: With dead ends: 83 [2023-02-14 02:21:27,364 INFO L226 Difference]: Without dead ends: 80 [2023-02-14 02:21:27,365 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-14 02:21:27,369 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 8 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-14 02:21:27,369 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-14 02:21:27,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-14 02:21:27,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-02-14 02:21:27,402 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-14 02:21:27,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2023-02-14 02:21:27,406 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 7 [2023-02-14 02:21:27,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:21:27,406 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2023-02-14 02:21:27,407 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-14 02:21:27,407 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2023-02-14 02:21:27,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-14 02:21:27,407 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:21:27,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:21:27,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 02:21:27,408 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-14 02:21:27,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:21:27,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1813904762, now seen corresponding path program 1 times [2023-02-14 02:21:27,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:21:27,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169023200] [2023-02-14 02:21:27,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:21:27,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:21:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:27,521 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-14 02:21:27,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:21:27,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169023200] [2023-02-14 02:21:27,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169023200] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:21:27,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:21:27,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 02:21:27,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144502113] [2023-02-14 02:21:27,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:21:27,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:21:27,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:21:27,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:21:27,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:21:27,528 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-14 02:21:27,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:21:27,616 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2023-02-14 02:21:27,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:21:27,617 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-14 02:21:27,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:21:27,620 INFO L225 Difference]: With dead ends: 78 [2023-02-14 02:21:27,620 INFO L226 Difference]: Without dead ends: 78 [2023-02-14 02:21:27,623 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-14 02:21:27,625 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-14 02:21:27,626 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-14 02:21:27,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-14 02:21:27,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-02-14 02:21:27,639 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-14 02:21:27,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2023-02-14 02:21:27,642 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 7 [2023-02-14 02:21:27,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:21:27,642 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2023-02-14 02:21:27,642 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-14 02:21:27,643 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2023-02-14 02:21:27,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-14 02:21:27,646 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:21:27,647 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:21:27,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 02:21:27,647 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-14 02:21:27,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:21:27,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1961810752, now seen corresponding path program 1 times [2023-02-14 02:21:27,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:21:27,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420093986] [2023-02-14 02:21:27,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:21:27,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:21:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:27,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 02:21:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:27,828 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-14 02:21:27,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:21:27,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420093986] [2023-02-14 02:21:27,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420093986] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:21:27,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:21:27,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 02:21:27,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342716809] [2023-02-14 02:21:27,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:21:27,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 02:21:27,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:21:27,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 02:21:27,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 02:21:27,832 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-14 02:21:27,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:21:27,995 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2023-02-14 02:21:27,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 02:21:27,995 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-14 02:21:27,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:21:27,999 INFO L225 Difference]: With dead ends: 82 [2023-02-14 02:21:27,999 INFO L226 Difference]: Without dead ends: 82 [2023-02-14 02:21:28,002 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-14 02:21:28,006 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.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:21:28,007 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.1s Time] [2023-02-14 02:21:28,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-14 02:21:28,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2023-02-14 02:21:28,013 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-14 02:21:28,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2023-02-14 02:21:28,014 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 13 [2023-02-14 02:21:28,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:21:28,014 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2023-02-14 02:21:28,014 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-14 02:21:28,014 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2023-02-14 02:21:28,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-14 02:21:28,015 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:21:28,015 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:21:28,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-14 02:21:28,015 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-14 02:21:28,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:21:28,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1961810753, now seen corresponding path program 1 times [2023-02-14 02:21:28,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:21:28,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871562562] [2023-02-14 02:21:28,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:21:28,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:21:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:28,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 02:21:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:28,180 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-14 02:21:28,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:21:28,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871562562] [2023-02-14 02:21:28,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871562562] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:21:28,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:21:28,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 02:21:28,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818807862] [2023-02-14 02:21:28,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:21:28,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 02:21:28,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:21:28,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 02:21:28,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 02:21:28,183 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-14 02:21:28,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:21:28,308 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2023-02-14 02:21:28,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 02:21:28,308 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-14 02:21:28,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:21:28,309 INFO L225 Difference]: With dead ends: 81 [2023-02-14 02:21:28,309 INFO L226 Difference]: Without dead ends: 81 [2023-02-14 02:21:28,309 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-14 02:21:28,320 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-14 02:21:28,322 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-14 02:21:28,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-14 02:21:28,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2023-02-14 02:21:28,332 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-14 02:21:28,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2023-02-14 02:21:28,335 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 13 [2023-02-14 02:21:28,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:21:28,335 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2023-02-14 02:21:28,336 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-14 02:21:28,336 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2023-02-14 02:21:28,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-14 02:21:28,337 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:21:28,337 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:21:28,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-14 02:21:28,337 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-14 02:21:28,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:21:28,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1399608384, now seen corresponding path program 1 times [2023-02-14 02:21:28,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:21:28,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698963553] [2023-02-14 02:21:28,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:21:28,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:21:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:28,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-14 02:21:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:28,470 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-14 02:21:28,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:21:28,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698963553] [2023-02-14 02:21:28,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698963553] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:21:28,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:21:28,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 02:21:28,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672450939] [2023-02-14 02:21:28,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:21:28,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 02:21:28,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:21:28,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 02:21:28,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 02:21:28,473 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-14 02:21:28,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:21:28,536 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2023-02-14 02:21:28,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 02:21:28,536 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-14 02:21:28,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:21:28,537 INFO L225 Difference]: With dead ends: 82 [2023-02-14 02:21:28,537 INFO L226 Difference]: Without dead ends: 82 [2023-02-14 02:21:28,538 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-14 02:21:28,538 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-14 02:21:28,539 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-14 02:21:28,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-14 02:21:28,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2023-02-14 02:21:28,557 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-14 02:21:28,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2023-02-14 02:21:28,558 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 15 [2023-02-14 02:21:28,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:21:28,559 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2023-02-14 02:21:28,559 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-14 02:21:28,559 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2023-02-14 02:21:28,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-14 02:21:28,560 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:21:28,560 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-14 02:21:28,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-14 02:21:28,560 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-14 02:21:28,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:21:28,561 INFO L85 PathProgramCache]: Analyzing trace with hash -898428094, now seen corresponding path program 1 times [2023-02-14 02:21:28,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:21:28,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160457683] [2023-02-14 02:21:28,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:21:28,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:21:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:28,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 02:21:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:28,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-14 02:21:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:28,686 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-14 02:21:28,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:21:28,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160457683] [2023-02-14 02:21:28,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160457683] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:21:28,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681373247] [2023-02-14 02:21:28,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:21:28,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:21:28,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:21:28,703 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-14 02:21:28,732 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-14 02:21:28,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:28,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 02:21:28,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:21:28,842 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-14 02:21:28,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:21:28,876 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-14 02:21:28,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681373247] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:21:28,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:21:28,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-02-14 02:21:28,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712165240] [2023-02-14 02:21:28,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:21:28,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 02:21:28,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:21:28,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 02:21:28,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-14 02:21:28,878 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-14 02:21:28,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:21:28,935 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2023-02-14 02:21:28,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 02:21:28,935 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-14 02:21:28,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:21:28,936 INFO L225 Difference]: With dead ends: 83 [2023-02-14 02:21:28,936 INFO L226 Difference]: Without dead ends: 83 [2023-02-14 02:21:28,936 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-14 02:21:28,937 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 4 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-14 02:21:28,937 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-14 02:21:28,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-14 02:21:28,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-02-14 02:21:28,939 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-14 02:21:28,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2023-02-14 02:21:28,940 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 28 [2023-02-14 02:21:28,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:21:28,940 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2023-02-14 02:21:28,940 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-14 02:21:28,940 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2023-02-14 02:21:28,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-14 02:21:28,941 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:21:28,941 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-14 02:21:28,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-14 02:21:29,147 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-14 02:21:29,147 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-14 02:21:29,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:21:29,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1437186176, now seen corresponding path program 2 times [2023-02-14 02:21:29,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:21:29,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324079416] [2023-02-14 02:21:29,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:21:29,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:21:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:29,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 02:21:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:29,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 02:21:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:29,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 02:21:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:29,699 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-14 02:21:29,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:21:29,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324079416] [2023-02-14 02:21:29,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324079416] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:21:29,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:21:29,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 02:21:29,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199679925] [2023-02-14 02:21:29,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:21:29,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 02:21:29,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:21:29,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 02:21:29,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-14 02:21:29,701 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-14 02:21:29,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:21:29,820 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2023-02-14 02:21:29,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 02:21:29,821 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-14 02:21:29,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:21:29,822 INFO L225 Difference]: With dead ends: 90 [2023-02-14 02:21:29,822 INFO L226 Difference]: Without dead ends: 90 [2023-02-14 02:21:29,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-14 02:21:29,823 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-14 02:21:29,823 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-14 02:21:29,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-14 02:21:29,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2023-02-14 02:21:29,830 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-14 02:21:29,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2023-02-14 02:21:29,832 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 41 [2023-02-14 02:21:29,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:21:29,835 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2023-02-14 02:21:29,835 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-14 02:21:29,835 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2023-02-14 02:21:29,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-14 02:21:29,837 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:21:29,837 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-14 02:21:29,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-14 02:21:29,838 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-14 02:21:29,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:21:29,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1437186175, now seen corresponding path program 1 times [2023-02-14 02:21:29,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:21:29,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477163366] [2023-02-14 02:21:29,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:21:29,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:21:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:30,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 02:21:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:30,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 02:21:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:30,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 02:21:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:30,396 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-14 02:21:30,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:21:30,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477163366] [2023-02-14 02:21:30,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477163366] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:21:30,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095610534] [2023-02-14 02:21:30,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:21:30,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:21:30,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:21:30,398 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-14 02:21:30,400 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-14 02:21:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:30,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-14 02:21:30,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:21:30,549 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-14 02:21:30,582 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-14 02:21:30,611 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-14 02:21:30,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:21:30,679 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-14 02:21:30,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 02:21:30,725 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-14 02:21:30,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:21:30,760 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-14 02:21:30,809 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-14 02:21:30,815 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-14 02:21:30,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:21:30,846 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-14 02:21:30,861 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-14 02:21:30,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:21:30,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095610534] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:21:30,936 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:21:30,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2023-02-14 02:21:30,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939488106] [2023-02-14 02:21:30,937 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:21:30,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-14 02:21:30,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:21:30,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-14 02:21:30,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=220, Unknown=3, NotChecked=96, Total=380 [2023-02-14 02:21:30,938 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-14 02:21:31,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:21:31,134 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2023-02-14 02:21:31,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 02:21:31,134 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-14 02:21:31,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:21:31,135 INFO L225 Difference]: With dead ends: 85 [2023-02-14 02:21:31,135 INFO L226 Difference]: Without dead ends: 85 [2023-02-14 02:21:31,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=268, Unknown=3, NotChecked=108, Total=462 [2023-02-14 02:21:31,136 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 313 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-14 02:21:31,136 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-14 02:21:31,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-14 02:21:31,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2023-02-14 02:21:31,138 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-14 02:21:31,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2023-02-14 02:21:31,138 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 41 [2023-02-14 02:21:31,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:21:31,138 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2023-02-14 02:21:31,138 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-14 02:21:31,138 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2023-02-14 02:21:31,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-14 02:21:31,139 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:21:31,139 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-14 02:21:31,161 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-14 02:21:31,345 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-14 02:21:31,346 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-14 02:21:31,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:21:31,346 INFO L85 PathProgramCache]: Analyzing trace with hash 2129253767, now seen corresponding path program 1 times [2023-02-14 02:21:31,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:21:31,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499894631] [2023-02-14 02:21:31,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:21:31,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:21:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:31,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 02:21:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:31,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 02:21:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:31,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 02:21:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:32,102 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-14 02:21:32,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:21:32,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499894631] [2023-02-14 02:21:32,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499894631] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:21:32,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902381791] [2023-02-14 02:21:32,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:21:32,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:21:32,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:21:32,104 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-14 02:21:32,106 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-14 02:21:32,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:32,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 66 conjunts are in the unsatisfiable core [2023-02-14 02:21:32,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:21:32,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 19 treesize of output 11 [2023-02-14 02:21:32,511 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-14 02:21:32,626 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-14 02:21:32,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:21:32,663 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-14 02:21:32,672 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 02:21:32,672 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-14 02:21:32,676 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-14 02:21:32,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:21:32,680 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-14 02:21: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 15 treesize of output 7 [2023-02-14 02:21:32,727 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-14 02:21:32,774 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-14 02:21:32,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:21:32,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902381791] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:21:32,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:21:32,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2023-02-14 02:21:32,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490660880] [2023-02-14 02:21:32,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:21:32,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-14 02:21:32,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:21:32,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-14 02:21:32,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1084, Unknown=1, NotChecked=66, Total=1260 [2023-02-14 02:21:32,988 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-14 02:21:33,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:21:33,989 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2023-02-14 02:21:33,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-14 02:21:33,991 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-14 02:21:33,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:21:33,991 INFO L225 Difference]: With dead ends: 112 [2023-02-14 02:21:33,991 INFO L226 Difference]: Without dead ends: 112 [2023-02-14 02:21:33,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=241, Invalid=2018, Unknown=1, NotChecked=92, Total=2352 [2023-02-14 02:21:33,993 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 343 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2023-02-14 02:21:33,993 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.5s Time] [2023-02-14 02:21:33,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-14 02:21:33,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 77. [2023-02-14 02:21:33,994 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-14 02:21:33,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2023-02-14 02:21:33,995 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 45 [2023-02-14 02:21:33,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:21:33,995 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2023-02-14 02:21:33,995 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-14 02:21:33,995 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2023-02-14 02:21:33,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-14 02:21:33,995 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:21:33,995 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-14 02:21:34,005 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-14 02:21:34,203 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-14 02:21:34,203 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-14 02:21:34,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:21:34,203 INFO L85 PathProgramCache]: Analyzing trace with hash 2129253766, now seen corresponding path program 1 times [2023-02-14 02:21:34,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:21:34,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448168140] [2023-02-14 02:21:34,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:21:34,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:21:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:34,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 02:21:34,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:34,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 02:21:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:34,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 02:21:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:34,656 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-14 02:21:34,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:21:34,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448168140] [2023-02-14 02:21:34,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448168140] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:21:34,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074535594] [2023-02-14 02:21:34,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:21:34,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:21:34,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:21:34,675 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-14 02:21:34,676 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-14 02:21:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:34,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-14 02:21:34,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:21:34,929 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-14 02:21:35,022 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-14 02:21:35,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:21:35,044 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-14 02:21:35,054 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-02-14 02:21:35,054 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-14 02:21:35,138 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-14 02:21:35,151 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-14 02:21:35,152 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 02:21:35,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074535594] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:21:35,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 02:21:35,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 26 [2023-02-14 02:21:35,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191643961] [2023-02-14 02:21:35,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:21:35,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-14 02:21:35,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:21:35,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-14 02:21:35,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=575, Unknown=2, NotChecked=48, Total=702 [2023-02-14 02:21:35,154 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-14 02:21:35,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:21:35,467 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2023-02-14 02:21:35,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-14 02:21:35,468 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-14 02:21:35,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:21:35,469 INFO L225 Difference]: With dead ends: 104 [2023-02-14 02:21:35,469 INFO L226 Difference]: Without dead ends: 104 [2023-02-14 02:21:35,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=811, Unknown=2, NotChecked=58, Total=992 [2023-02-14 02:21:35,470 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.2s IncrementalHoareTripleChecker+Time [2023-02-14 02:21:35,470 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.2s Time] [2023-02-14 02:21:35,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-14 02:21:35,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 75. [2023-02-14 02:21:35,471 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-14 02:21:35,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2023-02-14 02:21:35,472 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 45 [2023-02-14 02:21:35,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:21:35,472 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2023-02-14 02:21:35,472 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-14 02:21:35,472 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2023-02-14 02:21:35,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-14 02:21:35,473 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:21:35,473 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-14 02:21:35,491 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-14 02:21:35,678 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-14 02:21:35,678 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-14 02:21:35,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:21:35,679 INFO L85 PathProgramCache]: Analyzing trace with hash -35949242, now seen corresponding path program 1 times [2023-02-14 02:21:35,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:21:35,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940891997] [2023-02-14 02:21:35,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:21:35,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:21:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:35,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 02:21:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:35,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 02:21:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:35,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 02:21:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:35,862 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-14 02:21:35,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:21:35,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940891997] [2023-02-14 02:21:35,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940891997] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:21:35,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:21:35,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-14 02:21:35,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191913042] [2023-02-14 02:21:35,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:21:35,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 02:21:35,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:21:35,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 02:21:35,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-14 02:21:35,865 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-14 02:21:36,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:21:36,067 INFO L93 Difference]: Finished difference Result 136 states and 149 transitions. [2023-02-14 02:21:36,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-14 02:21:36,067 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-14 02:21:36,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:21:36,070 INFO L225 Difference]: With dead ends: 136 [2023-02-14 02:21:36,070 INFO L226 Difference]: Without dead ends: 136 [2023-02-14 02:21:36,070 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-14 02:21:36,071 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.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:21:36,071 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.1s Time] [2023-02-14 02:21:36,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-14 02:21:36,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 79. [2023-02-14 02:21:36,073 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-14 02:21:36,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2023-02-14 02:21:36,074 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 48 [2023-02-14 02:21:36,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:21:36,074 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2023-02-14 02:21:36,074 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-14 02:21:36,074 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2023-02-14 02:21:36,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-14 02:21:36,077 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:21:36,077 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-14 02:21:36,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-14 02:21:36,077 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-14 02:21:36,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:21:36,078 INFO L85 PathProgramCache]: Analyzing trace with hash -35949241, now seen corresponding path program 1 times [2023-02-14 02:21:36,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:21:36,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638224249] [2023-02-14 02:21:36,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:21:36,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:21:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:36,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 02:21:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:36,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 02:21:36,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:36,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 02:21:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:36,429 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-14 02:21:36,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:21:36,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638224249] [2023-02-14 02:21:36,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638224249] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:21:36,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:21:36,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-14 02:21:36,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736656323] [2023-02-14 02:21:36,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:21:36,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 02:21:36,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:21:36,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 02:21:36,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-14 02:21:36,433 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-14 02:21:36,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:21:36,620 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2023-02-14 02:21:36,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-14 02:21:36,621 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-14 02:21:36,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:21:36,621 INFO L225 Difference]: With dead ends: 126 [2023-02-14 02:21:36,621 INFO L226 Difference]: Without dead ends: 126 [2023-02-14 02:21:36,622 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-14 02:21:36,622 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.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:21:36,622 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.1s Time] [2023-02-14 02:21:36,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-14 02:21:36,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 81. [2023-02-14 02:21:36,623 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-14 02:21:36,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2023-02-14 02:21:36,624 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 48 [2023-02-14 02:21:36,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:21:36,624 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2023-02-14 02:21:36,624 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-14 02:21:36,624 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2023-02-14 02:21:36,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-14 02:21:36,624 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:21:36,625 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-14 02:21:36,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-14 02:21:36,625 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-14 02:21:36,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:21:36,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1114427801, now seen corresponding path program 1 times [2023-02-14 02:21:36,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:21:36,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289374491] [2023-02-14 02:21:36,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:21:36,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:21:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:36,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 02:21:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:36,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 02:21:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:36,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 02:21:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:36,865 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-14 02:21:36,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:21:36,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289374491] [2023-02-14 02:21:36,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289374491] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:21:36,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:21:36,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-14 02:21:36,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209378701] [2023-02-14 02:21:36,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:21:36,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 02:21:36,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:21:36,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 02:21:36,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-14 02:21:36,867 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-14 02:21:37,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:21:37,006 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2023-02-14 02:21:37,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-14 02:21:37,007 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-14 02:21:37,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:21:37,007 INFO L225 Difference]: With dead ends: 109 [2023-02-14 02:21:37,007 INFO L226 Difference]: Without dead ends: 109 [2023-02-14 02:21:37,007 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-14 02:21:37,008 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-14 02:21:37,008 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-14 02:21:37,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-14 02:21:37,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 81. [2023-02-14 02:21:37,009 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-14 02:21:37,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2023-02-14 02:21:37,010 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 49 [2023-02-14 02:21:37,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:21:37,010 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2023-02-14 02:21:37,010 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-14 02:21:37,010 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2023-02-14 02:21:37,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-14 02:21:37,010 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:21:37,010 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-14 02:21:37,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-14 02:21:37,010 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-14 02:21:37,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:21:37,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1553828739, now seen corresponding path program 1 times [2023-02-14 02:21:37,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:21:37,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102932959] [2023-02-14 02:21:37,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:21:37,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:21:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:37,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 02:21:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:37,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 02:21:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:38,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 02:21:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:38,400 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-14 02:21:38,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:21:38,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102932959] [2023-02-14 02:21:38,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102932959] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:21:38,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015478298] [2023-02-14 02:21:38,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:21:38,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:21:38,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:21:38,402 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-14 02:21:38,413 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-14 02:21:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:38,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 104 conjunts are in the unsatisfiable core [2023-02-14 02:21:38,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:21:38,951 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 02:21:38,951 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-14 02:21:38,960 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-14 02:21:39,100 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-14 02:21:39,105 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-14 02:21:39,570 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:21:39,570 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-14 02:21:39,581 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:21:39,582 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-14 02:21:39,735 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-14 02:21:39,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:21:39,771 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 02:21:39,771 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-14 02:21:39,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:21:39,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:21:39,782 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 02:21:39,782 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-14 02:21:39,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:21:39,789 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-14 02:21:39,805 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-14 02:21:39,805 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-14 02:21:40,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:21:40,042 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:21:40,044 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:21:40,044 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-14 02:21:40,051 INFO L321 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2023-02-14 02:21:40,051 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-14 02:21:40,126 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-14 02:21:40,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:21:40,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015478298] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:21:40,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:21:40,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22] total 48 [2023-02-14 02:21:40,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991406563] [2023-02-14 02:21:40,492 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:21:40,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-02-14 02:21:40,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:21:40,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-02-14 02:21:40,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2496, Unknown=2, NotChecked=100, Total=2756 [2023-02-14 02:21:40,495 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-14 02:21:45,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:21:45,996 INFO L93 Difference]: Finished difference Result 183 states and 200 transitions. [2023-02-14 02:21:45,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-14 02:21:45,996 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-14 02:21:45,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:21:45,997 INFO L225 Difference]: With dead ends: 183 [2023-02-14 02:21:45,997 INFO L226 Difference]: Without dead ends: 183 [2023-02-14 02:21:45,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1109 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=698, Invalid=5466, Unknown=2, NotChecked=154, Total=6320 [2023-02-14 02:21:45,998 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-14 02:21:45,999 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-14 02:21:45,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-02-14 02:21:46,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 80. [2023-02-14 02:21:46,000 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-14 02:21:46,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2023-02-14 02:21:46,001 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 49 [2023-02-14 02:21:46,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:21:46,001 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2023-02-14 02:21:46,001 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-14 02:21:46,001 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2023-02-14 02:21:46,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-14 02:21:46,001 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:21:46,002 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-14 02:21:46,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-14 02:21:46,207 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-14 02:21:46,207 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-14 02:21:46,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:21:46,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1553828740, now seen corresponding path program 1 times [2023-02-14 02:21:46,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:21:46,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529069093] [2023-02-14 02:21:46,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:21:46,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:21:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:46,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 02:21:46,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:46,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 02:21:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:47,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 02:21:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:47,338 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-14 02:21:47,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:21:47,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529069093] [2023-02-14 02:21:47,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529069093] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:21:47,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357744805] [2023-02-14 02:21:47,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:21:47,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:21:47,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:21:47,346 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-14 02:21:47,371 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-14 02:21:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:47,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 91 conjunts are in the unsatisfiable core [2023-02-14 02:21:47,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:21:47,761 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-02-14 02:21:47,761 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-14 02:21:47,852 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-14 02:21:48,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:21:48,080 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:21:48,080 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-14 02:21:48,084 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-14 02:21:48,214 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-14 02:21:48,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:21:48,268 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 02:21:48,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 55 [2023-02-14 02:21:48,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:21:48,279 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-14 02:21:48,313 INFO L321 Elim1Store]: treesize reduction 90, result has 37.9 percent of original size [2023-02-14 02:21:48,314 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-14 02:21:48,482 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-14 02:21:48,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:21:48,722 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:21:48,722 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-14 02:21:48,821 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-14 02:21:48,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:21:49,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357744805] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:21:49,043 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:21:49,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 45 [2023-02-14 02:21:49,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330515873] [2023-02-14 02:21:49,044 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:21:49,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-14 02:21:49,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:21:49,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-14 02:21:49,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2177, Unknown=2, NotChecked=94, Total=2450 [2023-02-14 02:21:49,045 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-14 02:21:51,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:21:51,408 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2023-02-14 02:21:51,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-14 02:21:51,408 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-14 02:21:51,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:21:51,409 INFO L225 Difference]: With dead ends: 122 [2023-02-14 02:21:51,409 INFO L226 Difference]: Without dead ends: 122 [2023-02-14 02:21:51,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1120 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=528, Invalid=4164, Unknown=4, NotChecked=134, Total=4830 [2023-02-14 02:21:51,411 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, 0.9s IncrementalHoareTripleChecker+Time [2023-02-14 02:21:51,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 1353 Invalid, 1700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1561 Invalid, 3 Unknown, 109 Unchecked, 0.9s Time] [2023-02-14 02:21:51,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-14 02:21:51,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 80. [2023-02-14 02:21:51,414 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-14 02:21:51,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2023-02-14 02:21:51,414 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 49 [2023-02-14 02:21:51,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:21:51,415 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2023-02-14 02:21:51,415 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-14 02:21:51,415 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2023-02-14 02:21:51,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-14 02:21:51,415 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:21:51,415 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-14 02:21:51,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-14 02:21:51,624 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-14 02:21:51,624 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-14 02:21:51,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:21:51,625 INFO L85 PathProgramCache]: Analyzing trace with hash 218878957, now seen corresponding path program 1 times [2023-02-14 02:21:51,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:21:51,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947349014] [2023-02-14 02:21:51,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:21:51,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:21:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:51,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 02:21:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:51,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 02:21:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:51,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 02:21:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:52,016 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-14 02:21:52,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:21:52,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947349014] [2023-02-14 02:21:52,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947349014] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:21:52,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761962270] [2023-02-14 02:21:52,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:21:52,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:21:52,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:21:52,018 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-14 02:21:52,020 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-14 02:21:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:52,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 60 conjunts are in the unsatisfiable core [2023-02-14 02:21:52,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:21:52,298 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-14 02:21:52,437 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-14 02:21:52,441 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-14 02:21:52,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:21:52,447 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-14 02:21:52,498 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-14 02:21:52,501 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-14 02:21:52,570 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-14 02:21:52,599 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-14 02:21:52,599 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 02:21:52,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761962270] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:21:52,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 02:21:52,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 27 [2023-02-14 02:21:52,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398093539] [2023-02-14 02:21:52,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:21:52,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-14 02:21:52,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:21:52,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-14 02:21:52,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2023-02-14 02:21:52,602 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-14 02:21:53,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:21:53,005 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2023-02-14 02:21:53,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-14 02:21:53,006 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-14 02:21:53,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:21:53,006 INFO L225 Difference]: With dead ends: 106 [2023-02-14 02:21:53,006 INFO L226 Difference]: Without dead ends: 106 [2023-02-14 02:21:53,007 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-14 02:21:53,007 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 138 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-14 02:21:53,007 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-14 02:21:53,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-14 02:21:53,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 81. [2023-02-14 02:21:53,009 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-14 02:21:53,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2023-02-14 02:21:53,009 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 52 [2023-02-14 02:21:53,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:21:53,009 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2023-02-14 02:21:53,009 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-14 02:21:53,009 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2023-02-14 02:21:53,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-14 02:21:53,010 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:21:53,010 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-14 02:21:53,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-14 02:21:53,216 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-14 02:21:53,216 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-14 02:21:53,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:21:53,217 INFO L85 PathProgramCache]: Analyzing trace with hash -521057353, now seen corresponding path program 1 times [2023-02-14 02:21:53,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:21:53,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483139496] [2023-02-14 02:21:53,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:21:53,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:21:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:53,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 02:21:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:53,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 02:21:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:53,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 02:21:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:53,648 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-14 02:21:53,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:21:53,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483139496] [2023-02-14 02:21:53,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483139496] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:21:53,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202324516] [2023-02-14 02:21:53,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:21:53,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:21:53,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:21:53,662 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-14 02:21:53,664 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-14 02:21:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:53,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 63 conjunts are in the unsatisfiable core [2023-02-14 02:21:53,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:21:53,823 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-14 02:21:53,852 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-14 02:21:53,868 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-14 02:21:53,875 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-14 02:21:53,888 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 02:21:53,889 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-14 02:21:53,962 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-14 02:21:54,002 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 02:21:54,003 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-14 02:21:54,186 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-14 02:21:54,266 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-14 02:21:54,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:21:54,287 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-14 02:21:54,299 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-14 02:21:54,300 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-14 02:21:54,425 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:21:54,425 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-14 02:21:54,456 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-14 02:21:54,460 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-14 02:21:54,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:21:54,469 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_~last~0#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-14 02:21:54,519 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int))) (= (select |c_#valid| (select (select (store |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|) 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-14 02:21:54,559 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-14 02:21:54,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202324516] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:21:54,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:21:54,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 42 [2023-02-14 02:21:54,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557289732] [2023-02-14 02:21:54,560 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:21:54,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-02-14 02:21:54,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:21:54,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-02-14 02:21:54,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1491, Unknown=21, NotChecked=498, Total=2162 [2023-02-14 02:21:54,562 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-14 02:21:55,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:21:55,506 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2023-02-14 02:21:55,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-14 02:21:55,507 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-14 02:21:55,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:21:55,507 INFO L225 Difference]: With dead ends: 156 [2023-02-14 02:21:55,507 INFO L226 Difference]: Without dead ends: 156 [2023-02-14 02:21:55,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=458, Invalid=2851, Unknown=21, NotChecked=702, Total=4032 [2023-02-14 02:21:55,509 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.4s IncrementalHoareTripleChecker+Time [2023-02-14 02:21:55,509 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.4s Time] [2023-02-14 02:21:55,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-14 02:21:55,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 87. [2023-02-14 02:21:55,510 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-14 02:21:55,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2023-02-14 02:21:55,511 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 52 [2023-02-14 02:21:55,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:21:55,511 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2023-02-14 02:21:55,511 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-14 02:21:55,511 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2023-02-14 02:21:55,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-14 02:21:55,511 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:21:55,512 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-14 02:21:55,525 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-14 02:21:55,720 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-14 02:21:55,720 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-14 02:21:55,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:21:55,721 INFO L85 PathProgramCache]: Analyzing trace with hash -521057352, now seen corresponding path program 1 times [2023-02-14 02:21:55,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:21:55,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201899792] [2023-02-14 02:21:55,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:21:55,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:21:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:56,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 02:21:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:56,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 02:21:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:56,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 02:21:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:56,597 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-14 02:21:56,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:21:56,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201899792] [2023-02-14 02:21:56,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201899792] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:21:56,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74654553] [2023-02-14 02:21:56,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:21:56,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:21:56,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:21:56,600 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-14 02:21:56,619 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-14 02:21:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:56,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 71 conjunts are in the unsatisfiable core [2023-02-14 02:21:56,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:21:57,163 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-14 02:21:57,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-14 02:21:57,266 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-14 02:21:57,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:21:57,299 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-14 02:21:57,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:21:57,309 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-14 02:21:57,612 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 02:21:57,612 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-14 02:21:57,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:21:57,621 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-14 02:21:57,625 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-14 02:21:57,666 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-14 02:21:57,668 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-14 02:21:57,715 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-14 02:21:57,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:21:57,826 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-14 02:21:57,905 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:21:57,906 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-14 02:21:59,497 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-14 02:21:59,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74654553] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:21:59,500 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:21:59,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 37 [2023-02-14 02:21:59,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399620010] [2023-02-14 02:21:59,501 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:21:59,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-14 02:21:59,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:21:59,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-14 02:21:59,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1747, Unknown=4, NotChecked=258, Total=2162 [2023-02-14 02:21:59,502 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-14 02:22:01,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:22:01,042 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2023-02-14 02:22:01,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-14 02:22:01,042 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-14 02:22:01,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:22:01,043 INFO L225 Difference]: With dead ends: 117 [2023-02-14 02:22:01,043 INFO L226 Difference]: Without dead ends: 117 [2023-02-14 02:22:01,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=452, Invalid=3216, Unknown=4, NotChecked=360, Total=4032 [2023-02-14 02:22:01,045 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-14 02:22:01,045 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-14 02:22:01,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-14 02:22:01,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 89. [2023-02-14 02:22:01,048 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-14 02:22:01,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2023-02-14 02:22:01,048 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 52 [2023-02-14 02:22:01,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:22:01,049 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2023-02-14 02:22:01,049 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-14 02:22:01,049 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2023-02-14 02:22:01,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-14 02:22:01,050 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:22:01,050 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-14 02:22:01,055 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-14 02:22:01,255 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-14 02:22:01,255 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-14 02:22:01,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:22:01,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1804686442, now seen corresponding path program 1 times [2023-02-14 02:22:01,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:22:01,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058308064] [2023-02-14 02:22:01,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:22:01,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:22:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:22:01,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 02:22:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:22:01,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 02:22:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:22:01,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 02:22:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:22:01,573 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-14 02:22:01,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:22:01,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058308064] [2023-02-14 02:22:01,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058308064] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:22:01,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055327058] [2023-02-14 02:22:01,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:22:01,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:22:01,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:22:01,588 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-14 02:22:01,610 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-14 02:22:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:22:01,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-14 02:22:01,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:22:01,992 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-14 02:22:02,039 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-14 02:22:02,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:22:02,049 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-14 02:22:02,072 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-14 02:22:02,099 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-14 02:22:02,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:22:02,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055327058] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:22:02,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:22:02,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2023-02-14 02:22:02,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026283835] [2023-02-14 02:22:02,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:22:02,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-14 02:22:02,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:22:02,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-14 02:22:02,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=4, NotChecked=50, Total=756 [2023-02-14 02:22:02,192 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-14 02:22:02,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:22:02,577 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2023-02-14 02:22:02,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-14 02:22:02,577 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-14 02:22:02,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:22:02,578 INFO L225 Difference]: With dead ends: 80 [2023-02-14 02:22:02,578 INFO L226 Difference]: Without dead ends: 80 [2023-02-14 02:22:02,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=4, NotChecked=66, Total=1260 [2023-02-14 02:22:02,579 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-14 02:22:02,579 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-14 02:22:02,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-14 02:22:02,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-02-14 02:22:02,584 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-14 02:22:02,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2023-02-14 02:22:02,584 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 53 [2023-02-14 02:22:02,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:22:02,585 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2023-02-14 02:22:02,585 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-14 02:22:02,585 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2023-02-14 02:22:02,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-14 02:22:02,585 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:22:02,585 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-14 02:22:02,595 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-14 02:22:02,791 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-14 02:22:02,792 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-14 02:22:02,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:22:02,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1947817869, now seen corresponding path program 2 times [2023-02-14 02:22:02,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:22:02,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885914252] [2023-02-14 02:22:02,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:22:02,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:22:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:22:03,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 02:22:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:22:03,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 02:22:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:22:04,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 02:22:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:22:04,789 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-14 02:22:04,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:22:04,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885914252] [2023-02-14 02:22:04,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885914252] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:22:04,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697238344] [2023-02-14 02:22:04,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 02:22:04,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:22:04,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:22:04,792 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-14 02:22:04,795 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-14 02:22:05,001 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 02:22:05,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 02:22:05,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 131 conjunts are in the unsatisfiable core [2023-02-14 02:22:05,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:22:05,083 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-14 02:22:05,233 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-14 02:22:05,238 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-14 02:22:05,595 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 02:22:05,595 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-14 02:22:05,599 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-14 02:22:05,612 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-02-14 02:22:05,613 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-14 02:22:05,619 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-14 02:22:05,733 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-14 02:22:05,742 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-14 02:22:06,083 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-02-14 02:22:06,084 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-14 02:22:06,094 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-02-14 02:22:06,095 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-14 02:22:06,099 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-14 02:22:06,212 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-14 02:22:06,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:22:06,255 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-14 02:22:06,256 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-14 02:22:06,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:22:06,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:22:06,269 INFO L321 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2023-02-14 02:22:06,270 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-14 02:22:06,293 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-02-14 02:22:06,294 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-14 02:22:06,719 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-02-14 02:22:06,719 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-14 02:22:06,730 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-02-14 02:22:06,730 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-14 02:22:06,772 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-14 02:22:06,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:22:07,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697238344] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:22:07,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:22:07,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28] total 52 [2023-02-14 02:22:07,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062144339] [2023-02-14 02:22:07,207 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:22:07,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-02-14 02:22:07,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:22:07,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-02-14 02:22:07,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=3027, Unknown=2, NotChecked=110, Total=3306 [2023-02-14 02:22:07,208 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-14 02:22:11,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:22:11,206 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2023-02-14 02:22:11,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-14 02:22:11,206 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-14 02:22:11,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:22:11,207 INFO L225 Difference]: With dead ends: 105 [2023-02-14 02:22:11,207 INFO L226 Difference]: Without dead ends: 105 [2023-02-14 02:22:11,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1346 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=428, Invalid=5274, Unknown=2, NotChecked=148, Total=5852 [2023-02-14 02:22:11,208 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 153 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.0s IncrementalHoareTripleChecker+Time [2023-02-14 02:22:11,208 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.0s Time] [2023-02-14 02:22:11,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-14 02:22:11,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2023-02-14 02:22:11,210 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-14 02:22:11,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2023-02-14 02:22:11,211 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 53 [2023-02-14 02:22:11,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:22:11,211 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2023-02-14 02:22:11,211 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-14 02:22:11,211 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2023-02-14 02:22:11,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-14 02:22:11,211 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:22:11,212 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-14 02:22:11,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-14 02:22:11,419 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-14 02:22:11,419 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-14 02:22:11,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:22:11,420 INFO L85 PathProgramCache]: Analyzing trace with hash 729745886, now seen corresponding path program 1 times [2023-02-14 02:22:11,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:22:11,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819013831] [2023-02-14 02:22:11,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:22:11,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:22:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:22:12,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 02:22:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:22:12,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 02:22:12,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:22:12,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 02:22:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:22:12,742 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-14 02:22:12,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:22:12,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819013831] [2023-02-14 02:22:12,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819013831] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:22:12,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470199074] [2023-02-14 02:22:12,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:22:12,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:22:12,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:22:12,744 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-14 02:22:12,746 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-14 02:22:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:22:12,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 105 conjunts are in the unsatisfiable core [2023-02-14 02:22:12,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:22:12,954 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-14 02:22:12,985 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-14 02:22:13,027 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-14 02:22:13,040 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-14 02:22:13,066 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 02:22:13,067 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-14 02:22:13,240 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 02:22:13,240 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-14 02:22:13,247 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-14 02:22:13,369 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-02-14 02:22:13,369 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-14 02:22:13,504 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-14 02:22:13,790 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:22:13,791 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-14 02:22:13,795 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-14 02:22:13,799 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-14 02:22:13,962 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-14 02:22:13,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:22:13,992 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-14 02:22:13,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:22:14,007 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 02:22:14,007 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-14 02:22:14,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:22:14,013 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-14 02:22:14,021 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 02:22:14,021 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-14 02:22:14,121 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-14 02:22:14,287 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-14 02:22:14,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:22:14,823 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-14 02:22:14,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470199074] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:22:14,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:22:14,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 47 [2023-02-14 02:22:14,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150372684] [2023-02-14 02:22:14,825 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:22:14,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-02-14 02:22:14,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:22:14,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-02-14 02:22:14,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2622, Unknown=15, NotChecked=420, Total=3192 [2023-02-14 02:22:14,828 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-14 02:22:18,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:22:18,006 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2023-02-14 02:22:18,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-14 02:22:18,006 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-14 02:22:18,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:22:18,007 INFO L225 Difference]: With dead ends: 104 [2023-02-14 02:22:18,007 INFO L226 Difference]: Without dead ends: 104 [2023-02-14 02:22:18,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=462, Invalid=4939, Unknown=17, NotChecked=588, Total=6006 [2023-02-14 02:22:18,009 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 334 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 26 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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-14 02:22:18,009 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-14 02:22:18,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-14 02:22:18,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2023-02-14 02:22:18,011 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-14 02:22:18,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2023-02-14 02:22:18,011 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 56 [2023-02-14 02:22:18,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:22:18,011 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2023-02-14 02:22:18,011 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-14 02:22:18,012 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2023-02-14 02:22:18,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-14 02:22:18,012 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:22:18,012 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-14 02:22:18,022 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-14 02:22:18,220 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-14 02:22:18,220 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-14 02:22:18,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:22:18,220 INFO L85 PathProgramCache]: Analyzing trace with hash 294390785, now seen corresponding path program 1 times [2023-02-14 02:22:18,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:22:18,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856024024] [2023-02-14 02:22:18,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:22:18,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:22:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:22:18,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 02:22:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:22:18,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 02:22:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:22:18,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 02:22:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:22:18,965 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-14 02:22:18,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:22:18,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856024024] [2023-02-14 02:22:18,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856024024] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:22:18,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851963623] [2023-02-14 02:22:18,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:22:18,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:22:18,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:22:18,967 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-14 02:22:18,969 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-14 02:22:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:22:19,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 87 conjunts are in the unsatisfiable core [2023-02-14 02:22:19,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:22:19,342 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-14 02:22:19,477 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-14 02:22:19,699 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:22:19,699 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-14 02:22:19,702 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-14 02:22:19,833 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-14 02:22:19,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:22:19,866 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 02:22:19,866 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-14 02:22:19,881 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-14 02:22:19,882 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-14 02:22:19,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:22:19,886 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-14 02:22:19,962 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-14 02:22:20,169 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-14 02:22:20,170 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-14 02:22:20,199 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-14 02:22:20,251 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:22:20,251 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-14 02:22:20,256 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-14 02:22:20,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:22:20,267 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-14 02:22:20,275 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_#t~mem10#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-14 02:22:20,279 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-14 02:22:20,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851963623] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:22:20,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:22:20,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 50 [2023-02-14 02:22:20,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382713476] [2023-02-14 02:22:20,551 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:22:20,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-02-14 02:22:20,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:22:20,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-02-14 02:22:20,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2534, Unknown=41, NotChecked=420, Total=3192 [2023-02-14 02:22:20,553 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-14 02:22:23,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:22:23,555 INFO L93 Difference]: Finished difference Result 176 states and 194 transitions. [2023-02-14 02:22:23,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-02-14 02:22:23,556 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-14 02:22:23,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:22:23,558 INFO L225 Difference]: With dead ends: 176 [2023-02-14 02:22:23,558 INFO L226 Difference]: Without dead ends: 176 [2023-02-14 02:22:23,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1472 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=889, Invalid=6055, Unknown=44, NotChecked=668, Total=7656 [2023-02-14 02:22:23,562 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 1284 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 35 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2023-02-14 02:22:23,563 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.8s Time] [2023-02-14 02:22:23,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-02-14 02:22:23,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 94. [2023-02-14 02:22:23,569 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-14 02:22:23,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2023-02-14 02:22:23,570 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 56 [2023-02-14 02:22:23,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:22:23,570 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2023-02-14 02:22:23,571 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-14 02:22:23,571 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2023-02-14 02:22:23,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-14 02:22:23,571 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:22:23,572 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-14 02:22:23,591 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-14 02:22:23,778 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-14 02:22:23,779 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-14 02:22:23,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:22:23,779 INFO L85 PathProgramCache]: Analyzing trace with hash 294390786, now seen corresponding path program 1 times [2023-02-14 02:22:23,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:22:23,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064846075] [2023-02-14 02:22:23,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:22:23,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:22:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:22:24,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 02:22:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:22:24,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 02:22:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:22:25,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 02:22:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:22:25,493 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-14 02:22:25,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:22:25,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064846075] [2023-02-14 02:22:25,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064846075] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:22:25,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893459912] [2023-02-14 02:22:25,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:22:25,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:22:25,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:22:25,494 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-14 02:22:25,496 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-14 02:22:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:22:25,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 105 conjunts are in the unsatisfiable core [2023-02-14 02:22:25,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:22:25,703 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-14 02:22:25,734 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-14 02:22:25,817 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 02:22:25,817 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-14 02:22:26,062 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-14 02:22:26,334 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:22:26,334 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-14 02:22:26,338 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-14 02:22:26,455 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-14 02:22:26,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:22:26,496 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 02:22:26,496 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-14 02:22:26,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:22:26,502 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-14 02:22:26,525 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 02:22:26,525 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-14 02:22:26,923 INFO L321 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2023-02-14 02:22:26,923 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-14 02:22:26,940 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-02-14 02:22:26,941 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-14 02:22:26,955 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:22:26,958 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 02:22:26,959 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 29 treesize of output 23 [2023-02-14 02:22:27,039 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:22:27,040 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-14 02:22:27,043 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-14 02:22:27,118 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-14 02:22:27,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:22:27,896 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:22:27,897 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-14 02:22:28,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893459912] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:22:28,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:22:28,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 60 [2023-02-14 02:22:28,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911790970] [2023-02-14 02:22:28,780 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:22:28,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-02-14 02:22:28,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:22:28,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-02-14 02:22:28,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=4828, Unknown=29, NotChecked=140, Total=5256 [2023-02-14 02:22:28,782 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-14 02:22:32,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:22:32,407 INFO L93 Difference]: Finished difference Result 162 states and 177 transitions. [2023-02-14 02:22:32,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-02-14 02:22:32,408 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-14 02:22:32,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:22:32,408 INFO L225 Difference]: With dead ends: 162 [2023-02-14 02:22:32,408 INFO L226 Difference]: Without dead ends: 162 [2023-02-14 02:22:32,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2608 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=977, Invalid=9709, Unknown=30, NotChecked=204, Total=10920 [2023-02-14 02:22:32,409 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 1262 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2023-02-14 02:22:32,410 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.8s Time] [2023-02-14 02:22:32,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-14 02:22:32,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 96. [2023-02-14 02:22:32,411 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-14 02:22:32,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2023-02-14 02:22:32,412 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 56 [2023-02-14 02:22:32,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:22:32,412 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2023-02-14 02:22:32,412 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-14 02:22:32,412 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2023-02-14 02:22:32,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-14 02:22:32,414 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:22:32,414 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-14 02:22:32,421 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-14 02:22:32,619 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-14 02:22:32,620 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-14 02:22:32,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:22:32,620 INFO L85 PathProgramCache]: Analyzing trace with hash 348951848, now seen corresponding path program 1 times [2023-02-14 02:22:32,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:22:32,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030079047] [2023-02-14 02:22:32,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:22:32,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:22:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:22:34,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 02:22:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:22:34,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 02:22:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:22:34,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 02:22:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:22:35,125 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-14 02:22:35,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:22:35,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030079047] [2023-02-14 02:22:35,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030079047] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:22:35,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887989304] [2023-02-14 02:22:35,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:22:35,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:22:35,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:22:35,127 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-14 02:22:35,129 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-14 02:22:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:22:35,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 128 conjunts are in the unsatisfiable core [2023-02-14 02:22:35,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:22:35,663 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-14 02:22:35,760 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-14 02:22:35,910 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 02:22:35,911 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-14 02:22:36,059 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-14 02:22:36,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:22:36,067 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-14 02:22:36,386 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:22:36,386 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-14 02:22:36,389 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-14 02:22:36,392 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-14 02:22:36,394 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-14 02:22:36,541 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-14 02:22:36,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:22:36,578 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 02:22:36,578 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-14 02:22:36,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:22:36,585 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-14 02:22:36,600 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-14 02:22:36,600 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-14 02:22:36,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:22:36,604 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-14 02:22:37,268 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-14 02:22:37,269 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-14 02:22:37,285 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-02-14 02:22:37,285 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-14 02:22:37,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:22:37,290 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-14 02:22:37,365 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:22:37,365 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-14 02:22:37,368 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-14 02:22:37,452 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-14 02:22:37,484 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-14 02:22:37,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:22:37,584 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-14 02:22:38,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887989304] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:22:38,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:22:38,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2023-02-14 02:22:38,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407583957] [2023-02-14 02:22:38,317 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:22:38,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-02-14 02:22:38,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:22:38,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-02-14 02:22:38,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=5295, Unknown=3, NotChecked=294, Total=5852 [2023-02-14 02:22:38,319 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-14 02:22:45,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:22:45,515 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2023-02-14 02:22:45,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-02-14 02:22:45,515 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-14 02:22:45,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:22:45,516 INFO L225 Difference]: With dead ends: 157 [2023-02-14 02:22:45,516 INFO L226 Difference]: Without dead ends: 157 [2023-02-14 02:22:45,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2613 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=1115, Invalid=10662, Unknown=3, NotChecked=430, Total=12210 [2023-02-14 02:22:45,529 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.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:22:45,529 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.1s Time] [2023-02-14 02:22:45,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-02-14 02:22:45,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 106. [2023-02-14 02:22:45,538 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-14 02:22:45,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2023-02-14 02:22:45,540 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 60 [2023-02-14 02:22:45,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:22:45,541 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2023-02-14 02:22:45,541 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-14 02:22:45,541 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2023-02-14 02:22:45,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-14 02:22:45,542 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:22:45,542 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-14 02:22:45,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-14 02:22:45,749 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-14 02:22:45,749 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-14 02:22:45,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:22:45,750 INFO L85 PathProgramCache]: Analyzing trace with hash -2067394117, now seen corresponding path program 1 times [2023-02-14 02:22:45,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:22:45,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117603484] [2023-02-14 02:22:45,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:22:45,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:22:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:22:47,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 02:22:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:22:47,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 02:22:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:22:47,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 02:22:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:22:47,910 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-14 02:22:47,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:22:47,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117603484] [2023-02-14 02:22:47,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117603484] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:22:47,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011770787] [2023-02-14 02:22:47,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:22:47,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:22:47,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:22:47,912 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-14 02:22:47,937 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-14 02:22:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:22:48,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 115 conjunts are in the unsatisfiable core [2023-02-14 02:22:48,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:22:48,165 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-14 02:22:48,169 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-14 02:22:48,236 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-14 02:22:48,239 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-14 02:22:48,393 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 02:22:48,394 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-14 02:22:48,402 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 02:22:48,403 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-14 02:22:48,617 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-14 02:22:48,814 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 02:22:48,815 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-14 02:22:48,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:22:48,829 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-14 02:22:49,050 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-14 02:22:49,533 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:22:49,533 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-14 02:22:49,538 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-14 02:22:49,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 02:22:49,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-14 02:22:49,770 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-14 02:22:49,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:22:49,833 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 02:22:49,834 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-14 02:22:49,871 INFO L321 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2023-02-14 02:22:49,871 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-14 02:22:49,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:22:49,878 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-14 02:22:49,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:22:49,883 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-14 02:22:50,298 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:22:50,299 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-14 02:22:50,612 INFO L321 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2023-02-14 02:22:50,613 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-14 02:22:50,633 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-14 02:22:50,772 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-14 02:22:51,018 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:22:51,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:22:51,020 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:22:51,021 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-14 02:22:51,458 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-14 02:22:51,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:22:52,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011770787] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:22:52,329 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:22:52,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 31] total 67 [2023-02-14 02:22:52,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500328142] [2023-02-14 02:22:52,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:22:52,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-02-14 02:22:52,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:22:52,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-02-14 02:22:52,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=5006, Unknown=2, NotChecked=142, Total=5402 [2023-02-14 02:22:52,332 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-14 02:23:06,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:23:06,121 INFO L93 Difference]: Finished difference Result 170 states and 182 transitions. [2023-02-14 02:23:06,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-02-14 02:23:06,121 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-14 02:23:06,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:23:06,122 INFO L225 Difference]: With dead ends: 170 [2023-02-14 02:23:06,122 INFO L226 Difference]: Without dead ends: 170 [2023-02-14 02:23:06,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2899 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=1480, Invalid=11402, Unknown=4, NotChecked=224, Total=13110 [2023-02-14 02:23:06,123 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1629 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 2096 mSolverCounterSat, 58 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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-14 02:23:06,123 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-14 02:23:06,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-02-14 02:23:06,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 109. [2023-02-14 02:23:06,125 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-14 02:23:06,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2023-02-14 02:23:06,126 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 61 [2023-02-14 02:23:06,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:23:06,126 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2023-02-14 02:23:06,127 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-14 02:23:06,127 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2023-02-14 02:23:06,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-14 02:23:06,127 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:23:06,127 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-14 02:23:06,134 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-14 02:23:06,333 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-14 02:23:06,334 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-14 02:23:06,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:23:06,334 INFO L85 PathProgramCache]: Analyzing trace with hash -2067394116, now seen corresponding path program 1 times [2023-02-14 02:23:06,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:23:06,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562402292] [2023-02-14 02:23:06,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:23:06,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:23:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:23:07,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 02:23:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:23:07,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 02:23:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:23:07,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 02:23:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:23:08,287 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-14 02:23:08,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:23:08,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562402292] [2023-02-14 02:23:08,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562402292] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:23:08,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261493737] [2023-02-14 02:23:08,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:23:08,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:23:08,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:23:08,290 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-14 02:23:08,295 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-14 02:23:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:23:08,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 133 conjunts are in the unsatisfiable core [2023-02-14 02:23:08,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:23:08,636 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-14 02:23:08,640 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-14 02:23:08,684 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-14 02:23:08,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 02:23:08,899 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 02:23:08,900 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-14 02:23:08,915 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 02:23:08,915 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-14 02:23:09,218 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 02:23:09,218 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-14 02:23:09,222 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-14 02:23:09,405 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-02-14 02:23:09,406 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-14 02:23:09,423 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 02:23:09,423 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-14 02:23:09,611 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-14 02:23:09,620 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-14 02:23:10,088 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:23:10,088 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-14 02:23:10,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:23:10,095 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-14 02:23:10,103 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 02:23:10,104 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-14 02:23:10,108 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-14 02:23:10,362 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-14 02:23:10,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:23:10,407 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 02:23:10,408 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-14 02:23:10,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:23:10,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:23:10,418 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-14 02:23:10,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:23:10,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:23:10,427 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-14 02:23:10,427 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-14 02:23:10,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:23:10,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:23:10,465 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-14 02:23:10,465 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-14 02:23:11,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:23:11,165 INFO L321 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2023-02-14 02:23:11,166 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-14 02:23:11,197 INFO L321 Elim1Store]: treesize reduction 65, result has 30.1 percent of original size [2023-02-14 02:23:11,197 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-14 02:23:11,620 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:23:11,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:23:11,623 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:23:11,623 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-14 02:23:11,633 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-14 02:23:11,633 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-14 02:23:12,000 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-14 02:23:12,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:23:14,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261493737] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:23:14,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:23:14,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 30] total 66 [2023-02-14 02:23:14,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378430075] [2023-02-14 02:23:14,038 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:23:14,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2023-02-14 02:23:14,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:23:14,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2023-02-14 02:23:14,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=5585, Unknown=8, NotChecked=150, Total=6006 [2023-02-14 02:23:14,041 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-14 02:23:57,510 WARN L233 SmtUtils]: Spent 8.50s 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-14 02:24:02,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:24:02,221 INFO L93 Difference]: Finished difference Result 174 states and 189 transitions. [2023-02-14 02:24:02,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-02-14 02:24:02,221 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-14 02:24:02,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:24:02,222 INFO L225 Difference]: With dead ends: 174 [2023-02-14 02:24:02,222 INFO L226 Difference]: Without dead ends: 174 [2023-02-14 02:24:02,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2554 ImplicationChecksByTransitivity, 50.0s TimeCoverageRelationStatistics Valid=1381, Invalid=12184, Unknown=11, NotChecked=230, Total=13806 [2023-02-14 02:24:02,223 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1352 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 2392 mSolverCounterSat, 42 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.5s IncrementalHoareTripleChecker+Time [2023-02-14 02:24:02,223 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.5s Time] [2023-02-14 02:24:02,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-02-14 02:24:02,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 111. [2023-02-14 02:24:02,230 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-14 02:24:02,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2023-02-14 02:24:02,233 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 61 [2023-02-14 02:24:02,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:24:02,233 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2023-02-14 02:24:02,234 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-14 02:24:02,234 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2023-02-14 02:24:02,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-14 02:24:02,234 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:24:02,234 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-14 02:24:02,241 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-14 02:24:02,435 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-14 02:24:02,435 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-14 02:24:02,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:24:02,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1413927454, now seen corresponding path program 1 times [2023-02-14 02:24:02,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:24:02,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29467773] [2023-02-14 02:24:02,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:24:02,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:24:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:24:04,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 02:24:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:24:04,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 02:24:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:24:05,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 02:24:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:24:06,158 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-14 02:24:06,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:24:06,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29467773] [2023-02-14 02:24:06,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29467773] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:24:06,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105901614] [2023-02-14 02:24:06,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:24:06,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:24:06,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:24:06,160 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-14 02:24:06,163 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-14 02:24:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:24:06,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 173 conjunts are in the unsatisfiable core [2023-02-14 02:24:06,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:24:06,454 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-14 02:24:06,533 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-14 02:24:06,685 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-14 02:24:06,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:24:06,868 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-14 02:24:07,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:24:07,066 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-14 02:24:07,299 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-14 02:24:07,305 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-14 02:24:07,309 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-14 02:24:07,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:24:07,830 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-14 02:24:07,848 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 02:24:07,849 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-14 02:24:07,856 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-14 02:24:07,869 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 02:24:07,870 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-14 02:24:08,085 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-14 02:24:08,093 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-14 02:24:08,100 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-14 02:24:08,700 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:24:08,701 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-14 02:24:08,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:24:08,709 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-14 02:24:08,714 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-14 02:24:08,718 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-14 02:24:08,722 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-14 02:24:08,973 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-14 02:24:09,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:24:09,026 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 02:24:09,026 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-14 02:24:09,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:24:09,041 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-14 02:24:09,065 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-14 02:24:09,065 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-14 02:24:09,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:24:09,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:24:09,073 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-14 02:24:09,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:24:09,084 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-14 02:24:09,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:24:09,940 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-14 02:24:10,244 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2023-02-14 02:24:10,245 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-14 02:24:10,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:24:10,274 INFO L321 Elim1Store]: treesize reduction 112, result has 16.4 percent of original size [2023-02-14 02:24:10,274 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-14 02:24:10,280 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:24:10,281 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-14 02:24:10,749 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:24:10,749 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:24:10,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:24:10,755 INFO L321 Elim1Store]: treesize reduction 3, result has 70.0 percent of original size [2023-02-14 02:24:10,756 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-14 02:24:10,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:24:10,764 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-14 02:24:10,765 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-14 02:24:11,060 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:24:11,062 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:24:11,062 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-14 02:24:11,118 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-14 02:24:11,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:24:12,162 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-14 02:24:15,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105901614] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:24:15,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:24:15,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 77 [2023-02-14 02:24:15,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080864127] [2023-02-14 02:24:15,650 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:24:15,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2023-02-14 02:24:15,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:24:15,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2023-02-14 02:24:15,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=7737, Unknown=13, NotChecked=354, Total=8372 [2023-02-14 02:24:15,652 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-14 02:24:31,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:24:31,585 INFO L93 Difference]: Finished difference Result 167 states and 183 transitions. [2023-02-14 02:24:31,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-02-14 02:24:31,585 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-14 02:24:31,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:24:31,590 INFO L225 Difference]: With dead ends: 167 [2023-02-14 02:24:31,590 INFO L226 Difference]: Without dead ends: 167 [2023-02-14 02:24:31,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 124 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1970 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=1201, Invalid=14043, Unknown=16, NotChecked=490, Total=15750 [2023-02-14 02:24:31,593 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 1355 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 3732 mSolverCounterSat, 65 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s 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.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:24:31,593 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.1s Time] [2023-02-14 02:24:31,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-02-14 02:24:31,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 116. [2023-02-14 02:24:31,612 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-14 02:24:31,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2023-02-14 02:24:31,622 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 65 [2023-02-14 02:24:31,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:24:31,622 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2023-02-14 02:24:31,623 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-14 02:24:31,623 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2023-02-14 02:24:31,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-14 02:24:31,623 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:24:31,623 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-14 02:24:31,633 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-14 02:24:31,829 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-14 02:24:31,830 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-14 02:24:31,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:24:31,830 INFO L85 PathProgramCache]: Analyzing trace with hash -655878667, now seen corresponding path program 3 times [2023-02-14 02:24:31,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:24:31,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195645197] [2023-02-14 02:24:31,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:24:31,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:24:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:24:31,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 02:24:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:24:31,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 02:24:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:24:31,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-14 02:24:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:24:31,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-02-14 02:24:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:24:31,940 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-14 02:24:31,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:24:31,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195645197] [2023-02-14 02:24:31,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195645197] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:24:31,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193270278] [2023-02-14 02:24:31,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 02:24:31,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:24:31,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:24:31,945 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-14 02:24:31,976 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-14 02:24:32,663 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-14 02:24:32,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 02:24:32,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 02:24:32,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:24:32,688 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-14 02:24:32,689 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 02:24:32,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193270278] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:24:32,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 02:24:32,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2023-02-14 02:24:32,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695047950] [2023-02-14 02:24:32,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:24:32,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 02:24:32,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:24:32,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 02:24:32,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-14 02:24:32,693 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-14 02:24:32,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:24:32,705 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2023-02-14 02:24:32,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 02:24:32,706 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-14 02:24:32,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:24:32,706 INFO L225 Difference]: With dead ends: 77 [2023-02-14 02:24:32,706 INFO L226 Difference]: Without dead ends: 77 [2023-02-14 02:24:32,707 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-14 02:24:32,707 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-14 02:24:32,708 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-14 02:24:32,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-14 02:24:32,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-02-14 02:24:32,711 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-14 02:24:32,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2023-02-14 02:24:32,712 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 66 [2023-02-14 02:24:32,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:24:32,712 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2023-02-14 02:24:32,713 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-14 02:24:32,713 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2023-02-14 02:24:32,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-14 02:24:32,716 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:24:32,716 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-14 02:24:32,726 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-14 02:24:32,926 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-14 02:24:32,927 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-14 02:24:32,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:24:32,928 INFO L85 PathProgramCache]: Analyzing trace with hash -882077631, now seen corresponding path program 2 times [2023-02-14 02:24:32,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:24:32,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726605953] [2023-02-14 02:24:32,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:24:32,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:24:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:24:35,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 02:24:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:24:35,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 02:24:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:24:36,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 02:24:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:24:36,627 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-14 02:24:36,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:24:36,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726605953] [2023-02-14 02:24:36,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726605953] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:24:36,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50734114] [2023-02-14 02:24:36,628 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 02:24:36,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:24:36,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:24:36,629 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-14 02:24:36,630 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-14 02:24:36,906 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 02:24:36,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 02:24:36,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 159 conjunts are in the unsatisfiable core [2023-02-14 02:24:36,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:24:36,954 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-14 02:24:37,033 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 02:24:37,033 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-14 02:24:37,194 INFO L321 Elim1Store]: treesize reduction 26, result has 27.8 percent of original size [2023-02-14 02:24:37,194 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-14 02:24:37,416 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-02-14 02:24:37,416 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-14 02:24:37,490 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-14 02:24:37,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:24:37,564 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-14 02:24:37,673 INFO L321 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2023-02-14 02:24:37,673 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-14 02:24:37,868 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-14 02:24:38,277 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:24:38,277 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-14 02:24:38,281 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-14 02:24:38,297 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-02-14 02:24:38,297 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-14 02:24:38,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:24:38,757 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 02:24:38,758 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-14 02:24:38,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:24:38,798 INFO L321 Elim1Store]: treesize reduction 108, result has 28.5 percent of original size [2023-02-14 02:24:38,799 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-14 02:24:38,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:24:38,823 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-14 02:24:39,758 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:24:39,776 INFO L321 Elim1Store]: treesize reduction 97, result has 19.8 percent of original size [2023-02-14 02:24:39,777 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-14 02:24:39,792 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-14 02:24:39,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 259 treesize of output 223 [2023-02-14 02:24:40,252 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-14 02:24:40,252 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-14 02:24:40,819 INFO L321 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2023-02-14 02:24:40,819 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-14 02:24:41,214 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-14 02:24:41,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:24:42,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50734114] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:24:42,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:24:42,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 37] total 80 [2023-02-14 02:24:42,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424060782] [2023-02-14 02:24:42,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:24:42,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2023-02-14 02:24:42,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:24:42,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2023-02-14 02:24:42,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=8818, Unknown=2, NotChecked=0, Total=9120 [2023-02-14 02:24:42,927 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-14 02:25:01,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:25:01,300 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2023-02-14 02:25:01,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-02-14 02:25:01,304 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-14 02:25:01,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:25:01,305 INFO L225 Difference]: With dead ends: 100 [2023-02-14 02:25:01,305 INFO L226 Difference]: Without dead ends: 100 [2023-02-14 02:25:01,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3358 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=1389, Invalid=15900, Unknown=3, NotChecked=0, Total=17292 [2023-02-14 02:25:01,308 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 1126 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 3108 mSolverCounterSat, 49 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s 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.5s IncrementalHoareTripleChecker+Time [2023-02-14 02:25:01,308 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.5s Time] [2023-02-14 02:25:01,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-14 02:25:01,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 79. [2023-02-14 02:25:01,311 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-14 02:25:01,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2023-02-14 02:25:01,311 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 66 [2023-02-14 02:25:01,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:25:01,312 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2023-02-14 02:25:01,312 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-14 02:25:01,312 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2023-02-14 02:25:01,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-14 02:25:01,313 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:25:01,313 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-14 02:25:01,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-02-14 02:25:01,532 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-14 02:25:01,532 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-14 02:25:01,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:25:01,532 INFO L85 PathProgramCache]: Analyzing trace with hash -882077630, now seen corresponding path program 2 times [2023-02-14 02:25:01,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:25:01,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915633749] [2023-02-14 02:25:01,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:25:01,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:25:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:25:03,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-14 02:25:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:25:03,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-14 02:25:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:25:03,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-14 02:25:03,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:25:04,527 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 02:25:04,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:25:04,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915633749] [2023-02-14 02:25:04,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915633749] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:25:04,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96126927] [2023-02-14 02:25:04,528 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 02:25:04,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:25:04,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:25:04,529 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:25:04,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-02-14 02:25:04,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 02:25:04,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 02:25:04,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 204 conjunts are in the unsatisfiable core [2023-02-14 02:25:04,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:25:04,830 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-14 02:25:04,834 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-14 02:25:04,892 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-14 02:25:04,895 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-14 02:25:05,062 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 02:25:05,062 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-14 02:25:05,066 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-14 02:25:05,331 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-14 02:25:05,401 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-14 02:25:05,408 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-14 02:25:05,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:25:05,483 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-14 02:25:05,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:25:05,490 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-14 02:25:05,588 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 02:25:05,588 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 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 02:25:05,610 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 02:25:05,611 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 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-14 02:25:05,804 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 13 [2023-02-14 02:25:05,818 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-14 02:25:06,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2023-02-14 02:25:06,265 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:25:06,265 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 68 treesize of output 35 [2023-02-14 02:25:06,270 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-14 02:25:06,276 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:25:06,276 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 15 treesize of output 7 [2023-02-14 02:25:06,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:25:06,735 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-14 02:25:06,736 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 76 treesize of output 68 [2023-02-14 02:25:06,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:25:06,743 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 20 treesize of output 22 [2023-02-14 02:25:06,776 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 02:25:06,777 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-14 02:25:06,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:25:06,785 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 02:25:06,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2023-02-14 02:25:07,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:25:07,934 INFO L321 Elim1Store]: treesize reduction 96, result has 17.9 percent of original size [2023-02-14 02:25:07,934 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 5 case distinctions, treesize of input 223 treesize of output 116 [2023-02-14 02:25:07,963 INFO L321 Elim1Store]: treesize reduction 128, result has 14.7 percent of original size [2023-02-14 02:25:07,964 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 6 case distinctions, treesize of input 229 treesize of output 141 [2023-02-14 02:25:10,216 INFO L321 Elim1Store]: treesize reduction 184, result has 59.7 percent of original size [2023-02-14 02:25:10,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 2 disjoint index pairs (out of 36 index pairs), introduced 15 new quantified variables, introduced 36 case distinctions, treesize of input 379 treesize of output 457 [2023-02-14 02:25:10,609 INFO L321 Elim1Store]: treesize reduction 152, result has 60.1 percent of original size [2023-02-14 02:25:10,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 2 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 36 case distinctions, treesize of input 465 treesize of output 563 [2023-02-14 02:25:21,708 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-14 02:25:21,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:25:31,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96126927] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:25:31,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:25:31,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42] total 82 [2023-02-14 02:25:31,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287058876] [2023-02-14 02:25:31,115 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:25:31,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2023-02-14 02:25:31,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:25:31,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2023-02-14 02:25:31,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=10391, Unknown=0, NotChecked=0, Total=10712 [2023-02-14 02:25:31,117 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 83 states, 80 states have (on average 1.4875) internal successors, (119), 74 states have internal predecessors, (119), 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)