./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f4b24e32 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/memsafety-ext2/split_list_test05-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db322df1d89bf1549765f136e3e3b8000484c0c3108c31998992cf725d6dcc20 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:25:05,998 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:25:05,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:25:06,062 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:25:06,062 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:25:06,063 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:25:06,065 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:25:06,069 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:25:06,071 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:25:06,075 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:25:06,076 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:25:06,078 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:25:06,079 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:25:06,081 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:25:06,082 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:25:06,085 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:25:06,086 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:25:06,101 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:25:06,102 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:25:06,107 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:25:06,109 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:25:06,110 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:25:06,111 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:25:06,111 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:25:06,112 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:25:06,114 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:25:06,115 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:25:06,115 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:25:06,116 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:25:06,117 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:25:06,117 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:25:06,118 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:25:06,119 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:25:06,119 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:25:06,120 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:25:06,120 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:25:06,121 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:25:06,121 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:25:06,121 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:25:06,121 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:25:06,122 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:25:06,123 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:25:06,125 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 06:25:06,154 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:25:06,157 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:25:06,158 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:25:06,158 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:25:06,158 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:25:06,159 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:25:06,159 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:25:06,159 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:25:06,159 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:25:06,160 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:25:06,160 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:25:06,161 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:25:06,161 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:25:06,161 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:25:06,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:25:06,161 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:25:06,161 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:25:06,161 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:25:06,162 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:25:06,163 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:25:06,163 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:25:06,163 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:25:06,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:25:06,164 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:25:06,164 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:25:06,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:25:06,164 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:25:06,164 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:25:06,164 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 06:25:06,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 06:25:06,165 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> db322df1d89bf1549765f136e3e3b8000484c0c3108c31998992cf725d6dcc20 [2022-07-14 06:25:06,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:25:06,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:25:06,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:25:06,438 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:25:06,438 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:25:06,439 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i [2022-07-14 06:25:06,492 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22423f5fa/8dbddb53c65e488a9410c6476b7147a9/FLAG1b590557c [2022-07-14 06:25:06,854 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:25:06,854 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i [2022-07-14 06:25:06,869 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22423f5fa/8dbddb53c65e488a9410c6476b7147a9/FLAG1b590557c [2022-07-14 06:25:07,252 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22423f5fa/8dbddb53c65e488a9410c6476b7147a9 [2022-07-14 06:25:07,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:25:07,256 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:25:07,257 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:25:07,257 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:25:07,260 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:25:07,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:25:07" (1/1) ... [2022-07-14 06:25:07,261 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f4b7a82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:25:07, skipping insertion in model container [2022-07-14 06:25:07,261 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:25:07" (1/1) ... [2022-07-14 06:25:07,266 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:25:07,309 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:25:07,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:25:07,541 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:25:07,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:25:07,593 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:25:07,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:25:07 WrapperNode [2022-07-14 06:25:07,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:25:07,594 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:25:07,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:25:07,595 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:25:07,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:25:07" (1/1) ... [2022-07-14 06:25:07,626 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:25:07" (1/1) ... [2022-07-14 06:25:07,659 INFO L137 Inliner]: procedures = 125, calls = 95, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 302 [2022-07-14 06:25:07,660 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:25:07,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:25:07,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:25:07,661 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:25:07,667 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:25:07" (1/1) ... [2022-07-14 06:25:07,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:25:07" (1/1) ... [2022-07-14 06:25:07,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:25:07" (1/1) ... [2022-07-14 06:25:07,684 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:25:07" (1/1) ... [2022-07-14 06:25:07,693 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:25:07" (1/1) ... [2022-07-14 06:25:07,696 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:25:07" (1/1) ... [2022-07-14 06:25:07,702 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:25:07" (1/1) ... [2022-07-14 06:25:07,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:25:07,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:25:07,712 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:25:07,712 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:25:07,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:25:07" (1/1) ... [2022-07-14 06:25:07,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:25:07,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:25:07,745 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 06:25:07,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 06:25:07,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 06:25:07,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 06:25:07,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 06:25:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 06:25:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 06:25:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 06:25:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 06:25:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 06:25:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:25:07,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:25:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure append [2022-07-14 06:25:07,796 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2022-07-14 06:25:07,896 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:25:07,902 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:25:08,436 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:25:08,444 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:25:08,444 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-07-14 06:25:08,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:25:08 BoogieIcfgContainer [2022-07-14 06:25:08,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:25:08,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:25:08,452 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:25:08,454 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:25:08,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:25:07" (1/3) ... [2022-07-14 06:25:08,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe0f43b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:25:08, skipping insertion in model container [2022-07-14 06:25:08,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:25:07" (2/3) ... [2022-07-14 06:25:08,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe0f43b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:25:08, skipping insertion in model container [2022-07-14 06:25:08,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:25:08" (3/3) ... [2022-07-14 06:25:08,457 INFO L111 eAbstractionObserver]: Analyzing ICFG split_list_test05-2.i [2022-07-14 06:25:08,470 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:25:08,470 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 147 error locations. [2022-07-14 06:25:08,524 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:25:08,538 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@bbf6a3c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@99cfae8 [2022-07-14 06:25:08,538 INFO L358 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2022-07-14 06:25:08,543 INFO L276 IsEmpty]: Start isEmpty. Operand has 323 states, 159 states have (on average 2.138364779874214) internal successors, (340), 308 states have internal predecessors, (340), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-14 06:25:08,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 06:25:08,552 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:25:08,552 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 06:25:08,552 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-14 06:25:08,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:25:08,556 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-14 06:25:08,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:25:08,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404986767] [2022-07-14 06:25:08,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:25:08,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:25:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:08,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:25:08,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:25:08,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404986767] [2022-07-14 06:25:08,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404986767] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:25:08,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:25:08,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:25:08,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974520393] [2022-07-14 06:25:08,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:25:08,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:25:08,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:25:08,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:25:08,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:25:08,724 INFO L87 Difference]: Start difference. First operand has 323 states, 159 states have (on average 2.138364779874214) internal successors, (340), 308 states have internal predecessors, (340), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:25:09,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:25:09,009 INFO L93 Difference]: Finished difference Result 548 states and 601 transitions. [2022-07-14 06:25:09,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:25:09,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-14 06:25:09,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:25:09,035 INFO L225 Difference]: With dead ends: 548 [2022-07-14 06:25:09,035 INFO L226 Difference]: Without dead ends: 546 [2022-07-14 06:25:09,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:25:09,039 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 246 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:25:09,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 435 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:25:09,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-07-14 06:25:09,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 407. [2022-07-14 06:25:09,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 246 states have (on average 2.089430894308943) internal successors, (514), 392 states have internal predecessors, (514), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-14 06:25:09,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 544 transitions. [2022-07-14 06:25:09,081 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 544 transitions. Word has length 3 [2022-07-14 06:25:09,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:25:09,082 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 544 transitions. [2022-07-14 06:25:09,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:25:09,082 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 544 transitions. [2022-07-14 06:25:09,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 06:25:09,082 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:25:09,082 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 06:25:09,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 06:25:09,083 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-14 06:25:09,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:25:09,083 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-14 06:25:09,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:25:09,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438094010] [2022-07-14 06:25:09,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:25:09,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:25:09,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:09,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:25:09,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:25:09,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438094010] [2022-07-14 06:25:09,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438094010] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:25:09,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:25:09,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:25:09,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402222147] [2022-07-14 06:25:09,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:25:09,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:25:09,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:25:09,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:25:09,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:25:09,113 INFO L87 Difference]: Start difference. First operand 407 states and 544 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:25:09,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:25:09,248 INFO L93 Difference]: Finished difference Result 408 states and 547 transitions. [2022-07-14 06:25:09,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:25:09,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-14 06:25:09,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:25:09,250 INFO L225 Difference]: With dead ends: 408 [2022-07-14 06:25:09,250 INFO L226 Difference]: Without dead ends: 408 [2022-07-14 06:25:09,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:25:09,252 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 6 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:25:09,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 553 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:25:09,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-07-14 06:25:09,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 405. [2022-07-14 06:25:09,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 246 states have (on average 2.0813008130081303) internal successors, (512), 390 states have internal predecessors, (512), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-14 06:25:09,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 542 transitions. [2022-07-14 06:25:09,265 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 542 transitions. Word has length 3 [2022-07-14 06:25:09,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:25:09,265 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 542 transitions. [2022-07-14 06:25:09,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:25:09,266 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 542 transitions. [2022-07-14 06:25:09,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 06:25:09,266 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:25:09,266 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:25:09,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 06:25:09,267 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-14 06:25:09,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:25:09,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1117386190, now seen corresponding path program 1 times [2022-07-14 06:25:09,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:25:09,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562414622] [2022-07-14 06:25:09,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:25:09,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:25:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:09,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:25:09,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:25:09,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562414622] [2022-07-14 06:25:09,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562414622] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:25:09,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:25:09,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:25:09,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421869761] [2022-07-14 06:25:09,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:25:09,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:25:09,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:25:09,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:25:09,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:25:09,302 INFO L87 Difference]: Start difference. First operand 405 states and 542 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2022-07-14 06:25:09,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:25:09,462 INFO L93 Difference]: Finished difference Result 400 states and 537 transitions. [2022-07-14 06:25:09,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:25:09,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2022-07-14 06:25:09,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:25:09,464 INFO L225 Difference]: With dead ends: 400 [2022-07-14 06:25:09,464 INFO L226 Difference]: Without dead ends: 400 [2022-07-14 06:25:09,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:25:09,465 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 43 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:25:09,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 496 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:25:09,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-07-14 06:25:09,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2022-07-14 06:25:09,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 246 states have (on average 2.0609756097560976) internal successors, (507), 385 states have internal predecessors, (507), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-14 06:25:09,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 537 transitions. [2022-07-14 06:25:09,475 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 537 transitions. Word has length 10 [2022-07-14 06:25:09,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:25:09,475 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 537 transitions. [2022-07-14 06:25:09,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2022-07-14 06:25:09,476 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 537 transitions. [2022-07-14 06:25:09,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 06:25:09,476 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:25:09,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:25:09,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 06:25:09,476 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-14 06:25:09,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:25:09,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1117386191, now seen corresponding path program 1 times [2022-07-14 06:25:09,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:25:09,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895715190] [2022-07-14 06:25:09,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:25:09,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:25:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:09,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:25:09,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:25:09,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895715190] [2022-07-14 06:25:09,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895715190] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:25:09,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:25:09,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:25:09,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187493912] [2022-07-14 06:25:09,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:25:09,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:25:09,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:25:09,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:25:09,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:25:09,531 INFO L87 Difference]: Start difference. First operand 400 states and 537 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2022-07-14 06:25:09,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:25:09,663 INFO L93 Difference]: Finished difference Result 395 states and 532 transitions. [2022-07-14 06:25:09,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:25:09,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2022-07-14 06:25:09,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:25:09,665 INFO L225 Difference]: With dead ends: 395 [2022-07-14 06:25:09,665 INFO L226 Difference]: Without dead ends: 395 [2022-07-14 06:25:09,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:25:09,666 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 38 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:25:09,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 509 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:25:09,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-07-14 06:25:09,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2022-07-14 06:25:09,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 246 states have (on average 2.040650406504065) internal successors, (502), 380 states have internal predecessors, (502), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-14 06:25:09,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 532 transitions. [2022-07-14 06:25:09,674 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 532 transitions. Word has length 10 [2022-07-14 06:25:09,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:25:09,675 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 532 transitions. [2022-07-14 06:25:09,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2022-07-14 06:25:09,675 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 532 transitions. [2022-07-14 06:25:09,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 06:25:09,675 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:25:09,675 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:25:09,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 06:25:09,676 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-14 06:25:09,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:25:09,676 INFO L85 PathProgramCache]: Analyzing trace with hash 279233943, now seen corresponding path program 1 times [2022-07-14 06:25:09,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:25:09,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843634533] [2022-07-14 06:25:09,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:25:09,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:25:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:09,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:25:09,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:25:09,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843634533] [2022-07-14 06:25:09,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843634533] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:25:09,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:25:09,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:25:09,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872599879] [2022-07-14 06:25:09,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:25:09,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:25:09,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:25:09,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:25:09,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:25:09,730 INFO L87 Difference]: Start difference. First operand 395 states and 532 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) [2022-07-14 06:25:10,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:25:10,111 INFO L93 Difference]: Finished difference Result 523 states and 574 transitions. [2022-07-14 06:25:10,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:25:10,112 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 11 [2022-07-14 06:25:10,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:25:10,113 INFO L225 Difference]: With dead ends: 523 [2022-07-14 06:25:10,113 INFO L226 Difference]: Without dead ends: 523 [2022-07-14 06:25:10,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:25:10,114 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 318 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:25:10,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 797 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:25:10,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-07-14 06:25:10,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 387. [2022-07-14 06:25:10,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 246 states have (on average 2.008130081300813) internal successors, (494), 372 states have internal predecessors, (494), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-14 06:25:10,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 524 transitions. [2022-07-14 06:25:10,122 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 524 transitions. Word has length 11 [2022-07-14 06:25:10,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:25:10,123 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 524 transitions. [2022-07-14 06:25:10,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) [2022-07-14 06:25:10,123 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 524 transitions. [2022-07-14 06:25:10,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 06:25:10,124 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:25:10,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:25:10,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 06:25:10,124 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-14 06:25:10,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:25:10,125 INFO L85 PathProgramCache]: Analyzing trace with hash 279233944, now seen corresponding path program 1 times [2022-07-14 06:25:10,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:25:10,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548054008] [2022-07-14 06:25:10,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:25:10,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:25:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:10,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:25:10,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:25:10,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548054008] [2022-07-14 06:25:10,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548054008] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:25:10,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:25:10,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:25:10,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881210695] [2022-07-14 06:25:10,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:25:10,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:25:10,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:25:10,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:25:10,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:25:10,189 INFO L87 Difference]: Start difference. First operand 387 states and 524 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) [2022-07-14 06:25:10,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:25:10,679 INFO L93 Difference]: Finished difference Result 513 states and 564 transitions. [2022-07-14 06:25:10,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:25:10,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 11 [2022-07-14 06:25:10,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:25:10,681 INFO L225 Difference]: With dead ends: 513 [2022-07-14 06:25:10,681 INFO L226 Difference]: Without dead ends: 513 [2022-07-14 06:25:10,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:25:10,682 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 802 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:25:10,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 440 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 06:25:10,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2022-07-14 06:25:10,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 378. [2022-07-14 06:25:10,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 246 states have (on average 1.967479674796748) internal successors, (484), 363 states have internal predecessors, (484), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-14 06:25:10,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 514 transitions. [2022-07-14 06:25:10,689 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 514 transitions. Word has length 11 [2022-07-14 06:25:10,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:25:10,689 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 514 transitions. [2022-07-14 06:25:10,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) [2022-07-14 06:25:10,689 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 514 transitions. [2022-07-14 06:25:10,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 06:25:10,690 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:25:10,690 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:25:10,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 06:25:10,690 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-14 06:25:10,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:25:10,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1620146378, now seen corresponding path program 1 times [2022-07-14 06:25:10,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:25:10,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278723165] [2022-07-14 06:25:10,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:25:10,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:25:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:10,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:25:10,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:25:10,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278723165] [2022-07-14 06:25:10,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278723165] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:25:10,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:25:10,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 06:25:10,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355928094] [2022-07-14 06:25:10,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:25:10,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:25:10,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:25:10,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:25:10,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:25:10,779 INFO L87 Difference]: Start difference. First operand 378 states and 514 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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) [2022-07-14 06:25:11,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:25:11,016 INFO L93 Difference]: Finished difference Result 398 states and 537 transitions. [2022-07-14 06:25:11,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:25:11,016 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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 20 [2022-07-14 06:25:11,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:25:11,018 INFO L225 Difference]: With dead ends: 398 [2022-07-14 06:25:11,018 INFO L226 Difference]: Without dead ends: 398 [2022-07-14 06:25:11,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:25:11,019 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 32 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:25:11,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1566 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:25:11,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-07-14 06:25:11,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 386. [2022-07-14 06:25:11,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 253 states have (on average 1.9446640316205535) internal successors, (492), 370 states have internal predecessors, (492), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 06:25:11,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 524 transitions. [2022-07-14 06:25:11,026 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 524 transitions. Word has length 20 [2022-07-14 06:25:11,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:25:11,026 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 524 transitions. [2022-07-14 06:25:11,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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) [2022-07-14 06:25:11,026 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 524 transitions. [2022-07-14 06:25:11,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 06:25:11,026 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:25:11,027 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:25:11,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 06:25:11,027 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-14 06:25:11,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:25:11,028 INFO L85 PathProgramCache]: Analyzing trace with hash 248818477, now seen corresponding path program 1 times [2022-07-14 06:25:11,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:25:11,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36023564] [2022-07-14 06:25:11,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:25:11,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:25:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:11,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:25:11,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:25:11,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36023564] [2022-07-14 06:25:11,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36023564] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:25:11,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:25:11,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 06:25:11,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049784095] [2022-07-14 06:25:11,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:25:11,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:25:11,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:25:11,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:25:11,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:25:11,161 INFO L87 Difference]: Start difference. First operand 386 states and 524 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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) [2022-07-14 06:25:11,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:25:11,655 INFO L93 Difference]: Finished difference Result 526 states and 579 transitions. [2022-07-14 06:25:11,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:25:11,656 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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 22 [2022-07-14 06:25:11,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:25:11,657 INFO L225 Difference]: With dead ends: 526 [2022-07-14 06:25:11,657 INFO L226 Difference]: Without dead ends: 526 [2022-07-14 06:25:11,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:25:11,658 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 751 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:25:11,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 1269 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:25:11,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-07-14 06:25:11,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 389. [2022-07-14 06:25:11,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 256 states have (on average 1.93359375) internal successors, (495), 373 states have internal predecessors, (495), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 06:25:11,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 527 transitions. [2022-07-14 06:25:11,666 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 527 transitions. Word has length 22 [2022-07-14 06:25:11,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:25:11,666 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 527 transitions. [2022-07-14 06:25:11,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 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) [2022-07-14 06:25:11,666 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 527 transitions. [2022-07-14 06:25:11,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-14 06:25:11,667 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:25:11,667 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:25:11,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 06:25:11,668 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-14 06:25:11,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:25:11,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1532217100, now seen corresponding path program 1 times [2022-07-14 06:25:11,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:25:11,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100357248] [2022-07-14 06:25:11,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:25:11,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:25:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:11,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 06:25:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:12,091 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:25:12,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:25:12,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100357248] [2022-07-14 06:25:12,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100357248] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:25:12,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604779635] [2022-07-14 06:25:12,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:25:12,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:25:12,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:25:12,094 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:25:12,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 06:25:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:12,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-14 06:25:12,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:25:12,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:25:12,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:25:12,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:25:12,574 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:25:12,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-14 06:25:12,588 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:25:12,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-14 06:25:12,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-14 06:25:12,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-14 06:25:12,711 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:25:12,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 06:25:12,775 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:25:12,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 06:25:12,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-07-14 06:25:13,005 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:13,012 INFO L356 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-07-14 06:25:13,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 28 [2022-07-14 06:25:13,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:25:13,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 28 [2022-07-14 06:25:13,175 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-07-14 06:25:13,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2022-07-14 06:25:13,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2022-07-14 06:25:13,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-07-14 06:25:13,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2022-07-14 06:25:13,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-07-14 06:25:13,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2022-07-14 06:25:13,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-07-14 06:25:13,456 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:13,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2022-07-14 06:25:13,461 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:13,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2022-07-14 06:25:13,505 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:25:13,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:25:13,568 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_329 (Array Int Int)) (v_ArrVal_330 (Array Int Int))) (let ((.cse0 (+ c_append_~head.offset 4))) (<= (+ 9 (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_330) c_append_~head.base) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_329) c_append_~head.base) .cse0))))) (forall ((v_ArrVal_330 (Array Int Int))) (<= 0 (+ 5 (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_330) c_append_~head.base) (+ c_append_~head.offset 4)))))) is different from false [2022-07-14 06:25:15,990 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:15,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 55 [2022-07-14 06:25:15,997 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:15,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 45 [2022-07-14 06:25:16,000 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:16,008 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:16,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 74 [2022-07-14 06:25:16,029 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:16,035 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:16,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 102 [2022-07-14 06:25:16,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2022-07-14 06:25:16,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2022-07-14 06:25:16,109 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-14 06:25:16,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 1 [2022-07-14 06:25:16,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:25:17,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604779635] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:25:17,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:25:17,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2022-07-14 06:25:17,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396764095] [2022-07-14 06:25:17,213 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:25:17,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-14 06:25:17,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:25:17,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-14 06:25:17,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=895, Unknown=5, NotChecked=60, Total=1056 [2022-07-14 06:25:17,214 INFO L87 Difference]: Start difference. First operand 389 states and 527 transitions. Second operand has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 23 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:25:19,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:25:19,306 INFO L93 Difference]: Finished difference Result 454 states and 616 transitions. [2022-07-14 06:25:19,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-14 06:25:19,306 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 23 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-07-14 06:25:19,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:25:19,309 INFO L225 Difference]: With dead ends: 454 [2022-07-14 06:25:19,309 INFO L226 Difference]: Without dead ends: 454 [2022-07-14 06:25:19,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=273, Invalid=1888, Unknown=5, NotChecked=90, Total=2256 [2022-07-14 06:25:19,310 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 127 mSDsluCounter, 3805 mSDsCounter, 0 mSdLazyCounter, 2656 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 4122 SdHoareTripleChecker+Invalid, 3760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1059 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:25:19,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 4122 Invalid, 3760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2656 Invalid, 0 Unknown, 1059 Unchecked, 1.1s Time] [2022-07-14 06:25:19,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-07-14 06:25:19,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 445. [2022-07-14 06:25:19,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 306 states have (on average 1.8169934640522876) internal successors, (556), 425 states have internal predecessors, (556), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (36), 17 states have call predecessors, (36), 19 states have call successors, (36) [2022-07-14 06:25:19,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 611 transitions. [2022-07-14 06:25:19,336 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 611 transitions. Word has length 37 [2022-07-14 06:25:19,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:25:19,336 INFO L495 AbstractCegarLoop]: Abstraction has 445 states and 611 transitions. [2022-07-14 06:25:19,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 23 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:25:19,336 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 611 transitions. [2022-07-14 06:25:19,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-14 06:25:19,340 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:25:19,340 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:25:19,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-14 06:25:19,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:25:19,541 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-14 06:25:19,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:25:19,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1532217101, now seen corresponding path program 1 times [2022-07-14 06:25:19,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:25:19,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618701782] [2022-07-14 06:25:19,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:25:19,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:25:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:19,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 06:25:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:19,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:25:19,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:25:19,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618701782] [2022-07-14 06:25:19,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618701782] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:25:19,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716568587] [2022-07-14 06:25:19,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:25:19,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:25:19,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:25:19,888 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:25:19,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-14 06:25:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:19,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-14 06:25:19,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:25:19,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:25:20,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:25:20,176 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:25:20,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-14 06:25:20,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-14 06:25:20,237 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:25:20,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 06:25:20,322 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:20,327 INFO L356 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-07-14 06:25:20,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 28 [2022-07-14 06:25:20,429 INFO L356 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2022-07-14 06:25:20,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2022-07-14 06:25:20,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-07-14 06:25:20,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-07-14 06:25:20,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-07-14 06:25:20,622 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:20,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-14 06:25:20,650 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:25:20,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:25:20,854 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:20,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-07-14 06:25:20,861 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:20,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 122 [2022-07-14 06:25:20,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 78 [2022-07-14 06:25:20,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2022-07-14 06:25:21,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716568587] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:25:21,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:25:21,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 27 [2022-07-14 06:25:21,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979473074] [2022-07-14 06:25:21,285 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:25:21,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-14 06:25:21,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:25:21,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-14 06:25:21,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=939, Unknown=11, NotChecked=0, Total=1056 [2022-07-14 06:25:21,286 INFO L87 Difference]: Start difference. First operand 445 states and 611 transitions. Second operand has 28 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 24 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:25:22,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:25:22,103 INFO L93 Difference]: Finished difference Result 482 states and 647 transitions. [2022-07-14 06:25:22,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 06:25:22,104 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 24 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-07-14 06:25:22,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:25:22,105 INFO L225 Difference]: With dead ends: 482 [2022-07-14 06:25:22,105 INFO L226 Difference]: Without dead ends: 482 [2022-07-14 06:25:22,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=172, Invalid=1375, Unknown=13, NotChecked=0, Total=1560 [2022-07-14 06:25:22,106 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 81 mSDsluCounter, 3714 mSDsCounter, 0 mSdLazyCounter, 1719 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 4022 SdHoareTripleChecker+Invalid, 2496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 756 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:25:22,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 4022 Invalid, 2496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1719 Invalid, 0 Unknown, 756 Unchecked, 0.5s Time] [2022-07-14 06:25:22,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-07-14 06:25:22,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 476. [2022-07-14 06:25:22,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 335 states have (on average 1.7552238805970148) internal successors, (588), 455 states have internal predecessors, (588), 19 states have call successors, (19), 5 states have call predecessors, (19), 6 states have return successors, (36), 17 states have call predecessors, (36), 19 states have call successors, (36) [2022-07-14 06:25:22,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 643 transitions. [2022-07-14 06:25:22,118 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 643 transitions. Word has length 37 [2022-07-14 06:25:22,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:25:22,118 INFO L495 AbstractCegarLoop]: Abstraction has 476 states and 643 transitions. [2022-07-14 06:25:22,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 24 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:25:22,118 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 643 transitions. [2022-07-14 06:25:22,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-14 06:25:22,122 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:25:22,122 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-14 06:25:22,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-14 06:25:22,339 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,SelfDestructingSolverStorable9 [2022-07-14 06:25:22,339 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-14 06:25:22,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:25:22,340 INFO L85 PathProgramCache]: Analyzing trace with hash -568836631, now seen corresponding path program 1 times [2022-07-14 06:25:22,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:25:22,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842122592] [2022-07-14 06:25:22,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:25:22,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:25:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:22,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 06:25:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:22,766 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:25:22,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:25:22,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842122592] [2022-07-14 06:25:22,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842122592] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:25:22,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965191401] [2022-07-14 06:25:22,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:25:22,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:25:22,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:25:22,768 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:25:22,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-14 06:25:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:22,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-14 06:25:22,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:25:22,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:25:23,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:25:23,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:25:23,088 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:25:23,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-14 06:25:23,098 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:25:23,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-14 06:25:23,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-14 06:25:23,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-14 06:25:23,196 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:25:23,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 06:25:23,206 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:25:23,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 06:25:23,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-07-14 06:25:23,421 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:23,427 INFO L356 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-07-14 06:25:23,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 28 [2022-07-14 06:25:23,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:25:23,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 28 [2022-07-14 06:25:23,580 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-07-14 06:25:23,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2022-07-14 06:25:23,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2022-07-14 06:25:23,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-07-14 06:25:23,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2022-07-14 06:25:23,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-07-14 06:25:23,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2022-07-14 06:25:23,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-07-14 06:25:23,796 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:23,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2022-07-14 06:25:23,800 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:23,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2022-07-14 06:25:23,825 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:25:23,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:25:23,887 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_706 (Array Int Int)) (v_ArrVal_705 (Array Int Int))) (let ((.cse0 (+ c_append_~head.offset 4))) (<= (+ 9 (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_705) c_append_~head.base) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_706) c_append_~head.base) .cse0))))) (forall ((v_ArrVal_705 (Array Int Int))) (<= 0 (+ 5 (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_705) c_append_~head.base) (+ c_append_~head.offset 4)))))) is different from false [2022-07-14 06:25:24,244 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:24,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 55 [2022-07-14 06:25:24,252 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:24,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 45 [2022-07-14 06:25:24,256 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:24,263 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:24,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 74 [2022-07-14 06:25:24,266 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:24,272 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:24,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 102 [2022-07-14 06:25:24,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 78 [2022-07-14 06:25:24,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2022-07-14 06:25:24,341 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-14 06:25:24,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 1 [2022-07-14 06:25:24,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:25:24,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965191401] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:25:24,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:25:24,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2022-07-14 06:25:24,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099828039] [2022-07-14 06:25:24,868 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:25:24,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-14 06:25:24,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:25:24,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-14 06:25:24,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=897, Unknown=4, NotChecked=60, Total=1056 [2022-07-14 06:25:24,869 INFO L87 Difference]: Start difference. First operand 476 states and 643 transitions. Second operand has 27 states, 26 states have (on average 2.730769230769231) internal successors, (71), 23 states have internal predecessors, (71), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:25:26,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:25:26,370 INFO L93 Difference]: Finished difference Result 515 states and 692 transitions. [2022-07-14 06:25:26,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 06:25:26,371 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.730769230769231) internal successors, (71), 23 states have internal predecessors, (71), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2022-07-14 06:25:26,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:25:26,373 INFO L225 Difference]: With dead ends: 515 [2022-07-14 06:25:26,373 INFO L226 Difference]: Without dead ends: 515 [2022-07-14 06:25:26,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=190, Invalid=1616, Unknown=4, NotChecked=82, Total=1892 [2022-07-14 06:25:26,374 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 61 mSDsluCounter, 3315 mSDsCounter, 0 mSdLazyCounter, 2108 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3629 SdHoareTripleChecker+Invalid, 2858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 716 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 06:25:26,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3629 Invalid, 2858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2108 Invalid, 0 Unknown, 716 Unchecked, 0.9s Time] [2022-07-14 06:25:26,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-07-14 06:25:26,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 493. [2022-07-14 06:25:26,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 351 states have (on average 1.735042735042735) internal successors, (609), 470 states have internal predecessors, (609), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (38), 18 states have call predecessors, (38), 20 states have call successors, (38) [2022-07-14 06:25:26,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 667 transitions. [2022-07-14 06:25:26,395 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 667 transitions. Word has length 39 [2022-07-14 06:25:26,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:25:26,395 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 667 transitions. [2022-07-14 06:25:26,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.730769230769231) internal successors, (71), 23 states have internal predecessors, (71), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:25:26,395 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 667 transitions. [2022-07-14 06:25:26,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-14 06:25:26,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:25:26,396 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-14 06:25:26,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-14 06:25:26,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:25:26,620 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-14 06:25:26,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:25:26,620 INFO L85 PathProgramCache]: Analyzing trace with hash -568836632, now seen corresponding path program 1 times [2022-07-14 06:25:26,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:25:26,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055701756] [2022-07-14 06:25:26,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:25:26,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:25:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:26,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 06:25:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:26,901 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:25:26,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:25:26,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055701756] [2022-07-14 06:25:26,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055701756] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:25:26,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80068889] [2022-07-14 06:25:26,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:25:26,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:25:26,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:25:26,908 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:25:26,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-14 06:25:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:27,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-14 06:25:27,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:25:27,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:25:27,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:25:27,174 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:25:27,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-14 06:25:27,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-14 06:25:27,215 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:25:27,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 06:25:27,264 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:27,270 INFO L356 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-07-14 06:25:27,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 28 [2022-07-14 06:25:27,367 INFO L356 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2022-07-14 06:25:27,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2022-07-14 06:25:27,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-07-14 06:25:27,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-07-14 06:25:27,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-07-14 06:25:27,568 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:27,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-14 06:25:27,592 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:25:27,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:25:27,612 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_894 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_894) c_append_~head.base) (+ c_append_~head.offset 4))) 1)) is different from false [2022-07-14 06:25:27,788 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:27,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-07-14 06:25:27,795 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:27,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 122 [2022-07-14 06:25:27,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 78 [2022-07-14 06:25:27,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2022-07-14 06:25:28,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80068889] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:25:28,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:25:28,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2022-07-14 06:25:28,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738885196] [2022-07-14 06:25:28,349 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:25:28,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-14 06:25:28,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:25:28,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-14 06:25:28,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1006, Unknown=3, NotChecked=64, Total=1190 [2022-07-14 06:25:28,351 INFO L87 Difference]: Start difference. First operand 493 states and 667 transitions. Second operand has 29 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 25 states have internal predecessors, (71), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:25:29,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:25:29,519 INFO L93 Difference]: Finished difference Result 658 states and 746 transitions. [2022-07-14 06:25:29,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 06:25:29,520 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 25 states have internal predecessors, (71), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2022-07-14 06:25:29,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:25:29,525 INFO L225 Difference]: With dead ends: 658 [2022-07-14 06:25:29,525 INFO L226 Difference]: Without dead ends: 658 [2022-07-14 06:25:29,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=264, Invalid=1629, Unknown=3, NotChecked=84, Total=1980 [2022-07-14 06:25:29,526 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 1109 mSDsluCounter, 2043 mSDsCounter, 0 mSdLazyCounter, 1806 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 2240 SdHoareTripleChecker+Invalid, 2550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 1806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 582 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-14 06:25:29,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 2240 Invalid, 2550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 1806 Invalid, 0 Unknown, 582 Unchecked, 0.8s Time] [2022-07-14 06:25:29,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2022-07-14 06:25:29,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 491. [2022-07-14 06:25:29,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 349 states have (on average 1.7220630372492836) internal successors, (601), 468 states have internal predecessors, (601), 20 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (38), 18 states have call predecessors, (38), 20 states have call successors, (38) [2022-07-14 06:25:29,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 659 transitions. [2022-07-14 06:25:29,539 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 659 transitions. Word has length 39 [2022-07-14 06:25:29,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:25:29,539 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 659 transitions. [2022-07-14 06:25:29,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 25 states have internal predecessors, (71), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:25:29,539 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 659 transitions. [2022-07-14 06:25:29,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-14 06:25:29,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:25:29,540 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-14 06:25:29,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-14 06:25:29,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:25:29,757 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-14 06:25:29,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:25:29,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1220540201, now seen corresponding path program 1 times [2022-07-14 06:25:29,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:25:29,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889787076] [2022-07-14 06:25:29,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:25:29,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:25:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:29,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 06:25:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:30,048 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:25:30,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:25:30,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889787076] [2022-07-14 06:25:30,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889787076] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:25:30,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123010152] [2022-07-14 06:25:30,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:25:30,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:25:30,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:25:30,052 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:25:30,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-14 06:25:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:30,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-14 06:25:30,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:25:30,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:25:30,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:25:30,387 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-14 06:25:30,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:25:30,417 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:25:30,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2022-07-14 06:25:30,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:25:30,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-07-14 06:25:30,458 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:25:30,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-07-14 06:25:30,514 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-14 06:25:30,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-14 06:25:30,574 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:25:30,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:25:30,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2022-07-14 06:25:30,623 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:30,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2022-07-14 06:25:30,627 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:25:30,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:25:30,634 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1074 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_1074) c_append_~head.base) c_append_~head.offset) 0))) is different from false [2022-07-14 06:25:30,640 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_append_~node~0.base_37 Int) (v_ArrVal_1074 (Array Int Int))) (or (not (= (select |c_#valid| v_append_~node~0.base_37) 0)) (not (= (select (select (store |c_#memory_$Pointer$.base| v_append_~node~0.base_37 v_ArrVal_1074) |c_append_#in~head.base|) |c_append_#in~head.offset|) 0)))) is different from false [2022-07-14 06:25:30,646 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_append_~node~0.base_37 Int) (v_ArrVal_1074 (Array Int Int))) (or (not (= (select |c_#valid| v_append_~node~0.base_37) 0)) (not (= (select (select (store |c_#memory_$Pointer$.base| v_append_~node~0.base_37 v_ArrVal_1074) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 0)))) is different from false [2022-07-14 06:25:30,716 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-14 06:25:30,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2022-07-14 06:25:30,718 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:30,721 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-14 06:25:30,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 34 [2022-07-14 06:25:30,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-07-14 06:25:30,729 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:25:30,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-14 06:25:30,850 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-14 06:25:30,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2022-07-14 06:25:30,863 INFO L356 Elim1Store]: treesize reduction 10, result has 71.4 percent of original size [2022-07-14 06:25:30,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 85 [2022-07-14 06:25:30,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2022-07-14 06:25:30,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2022-07-14 06:25:31,082 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:25:31,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-14 06:25:31,189 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-14 06:25:31,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123010152] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:25:31,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:25:31,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 15] total 37 [2022-07-14 06:25:31,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706383268] [2022-07-14 06:25:31,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:25:31,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-14 06:25:31,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:25:31,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-14 06:25:31,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=965, Unknown=5, NotChecked=198, Total=1332 [2022-07-14 06:25:31,190 INFO L87 Difference]: Start difference. First operand 491 states and 659 transitions. Second operand has 37 states, 37 states have (on average 2.2432432432432434) internal successors, (83), 31 states have internal predecessors, (83), 6 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:25:32,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:25:32,685 INFO L93 Difference]: Finished difference Result 616 states and 670 transitions. [2022-07-14 06:25:32,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-14 06:25:32,685 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.2432432432432434) internal successors, (83), 31 states have internal predecessors, (83), 6 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 39 [2022-07-14 06:25:32,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:25:32,687 INFO L225 Difference]: With dead ends: 616 [2022-07-14 06:25:32,687 INFO L226 Difference]: Without dead ends: 616 [2022-07-14 06:25:32,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=409, Invalid=1945, Unknown=10, NotChecked=288, Total=2652 [2022-07-14 06:25:32,688 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 628 mSDsluCounter, 2536 mSDsCounter, 0 mSdLazyCounter, 2525 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 2724 SdHoareTripleChecker+Invalid, 4080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 2525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1422 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 06:25:32,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 2724 Invalid, 4080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 2525 Invalid, 0 Unknown, 1422 Unchecked, 0.9s Time] [2022-07-14 06:25:32,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2022-07-14 06:25:32,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 464. [2022-07-14 06:25:32,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 323 states have (on average 1.743034055727554) internal successors, (563), 441 states have internal predecessors, (563), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-07-14 06:25:32,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 603 transitions. [2022-07-14 06:25:32,698 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 603 transitions. Word has length 39 [2022-07-14 06:25:32,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:25:32,698 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 603 transitions. [2022-07-14 06:25:32,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.2432432432432434) internal successors, (83), 31 states have internal predecessors, (83), 6 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:25:32,699 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 603 transitions. [2022-07-14 06:25:32,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-14 06:25:32,699 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:25:32,699 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-14 06:25:32,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-14 06:25:32,911 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,SelfDestructingSolverStorable12 [2022-07-14 06:25:32,911 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-14 06:25:32,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:25:32,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1913380289, now seen corresponding path program 1 times [2022-07-14 06:25:32,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:25:32,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785372889] [2022-07-14 06:25:32,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:25:32,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:25:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:33,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 06:25:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:33,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 06:25:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:33,145 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:25:33,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:25:33,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785372889] [2022-07-14 06:25:33,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785372889] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:25:33,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978942663] [2022-07-14 06:25:33,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:25:33,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:25:33,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:25:33,160 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:25:33,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-14 06:25:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:33,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-14 06:25:33,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:25:33,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:25:33,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:25:33,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:25:33,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:25:33,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-07-14 06:25:33,611 INFO L356 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2022-07-14 06:25:33,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2022-07-14 06:25:33,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 36 [2022-07-14 06:25:33,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-07-14 06:25:33,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 36 [2022-07-14 06:25:33,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-07-14 06:25:33,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 36 [2022-07-14 06:25:33,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-07-14 06:25:33,833 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:33,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-07-14 06:25:33,837 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:33,839 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:33,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 17 [2022-07-14 06:25:33,859 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:25:33,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:25:33,907 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1353 (Array Int Int))) (<= 0 (+ 5 (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_1353) c_append_~head.base) (+ c_append_~head.offset 4))))) (forall ((v_ArrVal_1354 (Array Int Int)) (v_ArrVal_1353 (Array Int Int))) (let ((.cse0 (+ c_append_~head.offset 4))) (<= (+ 9 (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_1353) c_append_~head.base) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_1354) c_append_~head.base) .cse0)))))) is different from false [2022-07-14 06:25:36,111 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:36,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-14 06:25:36,114 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:36,120 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-07-14 06:25:36,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 13 [2022-07-14 06:25:36,128 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-14 06:25:36,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 1 [2022-07-14 06:25:36,253 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:36,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-14 06:25:36,259 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:36,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 43 [2022-07-14 06:25:36,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:25:36,278 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:36,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 49 [2022-07-14 06:25:36,286 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:36,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2022-07-14 06:25:36,291 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:36,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:25:36,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:25:36,302 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:36,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:25:36,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-07-14 06:25:36,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2022-07-14 06:25:36,988 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 9 not checked. [2022-07-14 06:25:36,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978942663] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:25:36,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:25:36,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-07-14 06:25:36,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853699079] [2022-07-14 06:25:36,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:25:36,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-14 06:25:36,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:25:36,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-14 06:25:36,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=777, Unknown=3, NotChecked=56, Total=930 [2022-07-14 06:25:36,990 INFO L87 Difference]: Start difference. First operand 464 states and 603 transitions. Second operand has 31 states, 27 states have (on average 4.148148148148148) internal successors, (112), 24 states have internal predecessors, (112), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 06:25:37,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:25:37,851 INFO L93 Difference]: Finished difference Result 496 states and 633 transitions. [2022-07-14 06:25:37,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-14 06:25:37,851 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 4.148148148148148) internal successors, (112), 24 states have internal predecessors, (112), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) Word has length 54 [2022-07-14 06:25:37,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:25:37,868 INFO L225 Difference]: With dead ends: 496 [2022-07-14 06:25:37,868 INFO L226 Difference]: Without dead ends: 496 [2022-07-14 06:25:37,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=257, Invalid=1724, Unknown=3, NotChecked=86, Total=2070 [2022-07-14 06:25:37,869 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 96 mSDsluCounter, 2274 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 2573 SdHoareTripleChecker+Invalid, 2079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 951 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:25:37,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 2573 Invalid, 2079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1102 Invalid, 0 Unknown, 951 Unchecked, 0.4s Time] [2022-07-14 06:25:37,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-07-14 06:25:37,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 462. [2022-07-14 06:25:37,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 323 states have (on average 1.743034055727554) internal successors, (563), 440 states have internal predecessors, (563), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-07-14 06:25:37,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 599 transitions. [2022-07-14 06:25:37,881 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 599 transitions. Word has length 54 [2022-07-14 06:25:37,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:25:37,882 INFO L495 AbstractCegarLoop]: Abstraction has 462 states and 599 transitions. [2022-07-14 06:25:37,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 4.148148148148148) internal successors, (112), 24 states have internal predecessors, (112), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 06:25:37,883 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 599 transitions. [2022-07-14 06:25:37,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-14 06:25:37,883 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:25:37,883 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-14 06:25:37,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-14 06:25:38,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:25:38,101 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-14 06:25:38,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:25:38,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1392743212, now seen corresponding path program 1 times [2022-07-14 06:25:38,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:25:38,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664473071] [2022-07-14 06:25:38,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:25:38,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:25:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:38,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 06:25:38,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:38,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 06:25:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:38,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 06:25:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:38,456 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 38 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-14 06:25:38,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:25:38,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664473071] [2022-07-14 06:25:38,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664473071] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:25:38,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378818185] [2022-07-14 06:25:38,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:25:38,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:25:38,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:25:38,458 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:25:38,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-14 06:25:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:38,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-14 06:25:38,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:25:38,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:25:38,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:25:38,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:25:38,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:25:38,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-07-14 06:25:38,844 INFO L356 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2022-07-14 06:25:38,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2022-07-14 06:25:38,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 36 [2022-07-14 06:25:38,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-07-14 06:25:38,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 36 [2022-07-14 06:25:38,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-07-14 06:25:38,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 36 [2022-07-14 06:25:38,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-07-14 06:25:39,022 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:39,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-07-14 06:25:39,025 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:39,026 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:39,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 17 [2022-07-14 06:25:39,043 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 41 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-14 06:25:39,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:25:39,087 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1728 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_1728) c_append_~head.base) (+ c_append_~head.offset 4)) 5))) (forall ((v_ArrVal_1728 (Array Int Int)) (v_ArrVal_1727 (Array Int Int))) (let ((.cse0 (+ c_append_~head.offset 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_1728) c_append_~head.base) .cse0) 9) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_1727) c_append_~head.base) .cse0)))))) is different from false [2022-07-14 06:25:39,393 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:39,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 49 [2022-07-14 06:25:39,398 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:39,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2022-07-14 06:25:39,400 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:39,406 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-07-14 06:25:39,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 27 [2022-07-14 06:25:39,409 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:39,410 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:39,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-07-14 06:25:39,416 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-14 06:25:39,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 1 [2022-07-14 06:25:39,550 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:39,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-14 06:25:39,557 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:39,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 43 [2022-07-14 06:25:39,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:25:39,577 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:39,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 49 [2022-07-14 06:25:39,582 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:39,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2022-07-14 06:25:39,584 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:39,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:25:39,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:25:39,590 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:39,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:25:39,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-07-14 06:25:39,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2022-07-14 06:25:40,302 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 41 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 7 not checked. [2022-07-14 06:25:40,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378818185] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:25:40,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:25:40,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2022-07-14 06:25:40,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375600383] [2022-07-14 06:25:40,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:25:40,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-14 06:25:40,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:25:40,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-14 06:25:40,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=938, Unknown=1, NotChecked=62, Total=1122 [2022-07-14 06:25:40,305 INFO L87 Difference]: Start difference. First operand 462 states and 599 transitions. Second operand has 34 states, 30 states have (on average 4.066666666666666) internal successors, (122), 27 states have internal predecessors, (122), 5 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-14 06:25:41,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:25:41,750 INFO L93 Difference]: Finished difference Result 617 states and 669 transitions. [2022-07-14 06:25:41,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 06:25:41,750 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 30 states have (on average 4.066666666666666) internal successors, (122), 27 states have internal predecessors, (122), 5 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2022-07-14 06:25:41,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:25:41,752 INFO L225 Difference]: With dead ends: 617 [2022-07-14 06:25:41,752 INFO L226 Difference]: Without dead ends: 617 [2022-07-14 06:25:41,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=288, Invalid=1521, Unknown=1, NotChecked=82, Total=1892 [2022-07-14 06:25:41,753 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 587 mSDsluCounter, 2339 mSDsCounter, 0 mSdLazyCounter, 2552 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 2488 SdHoareTripleChecker+Invalid, 4030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1411 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:25:41,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 2488 Invalid, 4030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 2552 Invalid, 0 Unknown, 1411 Unchecked, 1.0s Time] [2022-07-14 06:25:41,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2022-07-14 06:25:41,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 478. [2022-07-14 06:25:41,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 338 states have (on average 1.7100591715976332) internal successors, (578), 455 states have internal predecessors, (578), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-07-14 06:25:41,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 614 transitions. [2022-07-14 06:25:41,766 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 614 transitions. Word has length 71 [2022-07-14 06:25:41,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:25:41,766 INFO L495 AbstractCegarLoop]: Abstraction has 478 states and 614 transitions. [2022-07-14 06:25:41,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 30 states have (on average 4.066666666666666) internal successors, (122), 27 states have internal predecessors, (122), 5 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-14 06:25:41,767 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 614 transitions. [2022-07-14 06:25:41,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-14 06:25:41,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:25:41,767 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:25:41,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-14 06:25:41,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:25:41,986 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-14 06:25:41,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:25:41,987 INFO L85 PathProgramCache]: Analyzing trace with hash 358204681, now seen corresponding path program 1 times [2022-07-14 06:25:41,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:25:41,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614547285] [2022-07-14 06:25:41,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:25:41,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:25:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:42,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 06:25:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:42,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 06:25:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:42,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 06:25:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:42,298 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-14 06:25:42,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:25:42,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614547285] [2022-07-14 06:25:42,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614547285] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:25:42,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219086654] [2022-07-14 06:25:42,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:25:42,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:25:42,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:25:42,300 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:25:42,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-14 06:25:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:42,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-14 06:25:42,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:25:42,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:25:42,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:25:42,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:25:42,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:25:42,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-07-14 06:25:42,735 INFO L356 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2022-07-14 06:25:42,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2022-07-14 06:25:42,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 36 [2022-07-14 06:25:42,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-07-14 06:25:42,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 36 [2022-07-14 06:25:42,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-07-14 06:25:42,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 36 [2022-07-14 06:25:42,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-07-14 06:25:42,912 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:42,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-07-14 06:25:42,915 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:42,919 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:42,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 17 [2022-07-14 06:25:42,933 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-14 06:25:42,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:25:42,994 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2103 (Array Int Int)) (v_ArrVal_2102 (Array Int Int))) (let ((.cse0 (+ c_append_~head.offset 4))) (<= (+ 9 (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_2102) c_append_~head.base) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_2103) c_append_~head.base) .cse0))))) (forall ((v_ArrVal_2102 (Array Int Int))) (<= 0 (+ 5 (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_2102) c_append_~head.base) (+ c_append_~head.offset 4)))))) is different from false [2022-07-14 06:25:43,399 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:43,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 49 [2022-07-14 06:25:43,404 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:43,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2022-07-14 06:25:43,406 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:43,411 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-07-14 06:25:43,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 27 [2022-07-14 06:25:43,414 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:43,415 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:43,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-07-14 06:25:43,420 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-14 06:25:43,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 1 [2022-07-14 06:25:43,542 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:43,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-14 06:25:43,547 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:43,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 43 [2022-07-14 06:25:43,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:25:43,579 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:43,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 49 [2022-07-14 06:25:43,584 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:43,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2022-07-14 06:25:43,587 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:43,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:25:43,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-14 06:25:43,592 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:43,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:25:43,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-07-14 06:25:43,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2022-07-14 06:25:44,345 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 41 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 7 not checked. [2022-07-14 06:25:44,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219086654] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:25:44,345 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:25:44,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 32 [2022-07-14 06:25:44,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576293230] [2022-07-14 06:25:44,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:25:44,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-14 06:25:44,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:25:44,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-14 06:25:44,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=894, Unknown=1, NotChecked=60, Total=1056 [2022-07-14 06:25:44,348 INFO L87 Difference]: Start difference. First operand 478 states and 614 transitions. Second operand has 33 states, 32 states have (on average 4.1875) internal successors, (134), 29 states have internal predecessors, (134), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 06:25:45,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:25:45,615 INFO L93 Difference]: Finished difference Result 511 states and 646 transitions. [2022-07-14 06:25:45,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 06:25:45,616 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 4.1875) internal successors, (134), 29 states have internal predecessors, (134), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2022-07-14 06:25:45,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:25:45,617 INFO L225 Difference]: With dead ends: 511 [2022-07-14 06:25:45,617 INFO L226 Difference]: Without dead ends: 511 [2022-07-14 06:25:45,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 145 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=316, Invalid=1667, Unknown=1, NotChecked=86, Total=2070 [2022-07-14 06:25:45,618 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 122 mSDsluCounter, 2572 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 2880 SdHoareTripleChecker+Invalid, 2494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1237 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:25:45,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 2880 Invalid, 2494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1219 Invalid, 0 Unknown, 1237 Unchecked, 0.6s Time] [2022-07-14 06:25:45,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2022-07-14 06:25:45,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 452. [2022-07-14 06:25:45,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 315 states have (on average 1.7492063492063492) internal successors, (551), 432 states have internal predecessors, (551), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 06:25:45,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 583 transitions. [2022-07-14 06:25:45,624 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 583 transitions. Word has length 81 [2022-07-14 06:25:45,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:25:45,624 INFO L495 AbstractCegarLoop]: Abstraction has 452 states and 583 transitions. [2022-07-14 06:25:45,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 4.1875) internal successors, (134), 29 states have internal predecessors, (134), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 06:25:45,625 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 583 transitions. [2022-07-14 06:25:45,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-14 06:25:45,625 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:25:45,625 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:25:45,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-14 06:25:45,844 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,SelfDestructingSolverStorable15 [2022-07-14 06:25:45,844 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-14 06:25:45,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:25:45,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1693525601, now seen corresponding path program 1 times [2022-07-14 06:25:45,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:25:45,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289070272] [2022-07-14 06:25:45,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:25:45,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:25:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:46,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 06:25:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:46,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 06:25:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:46,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 06:25:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:46,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 06:25:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:46,245 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 64 proven. 15 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-14 06:25:46,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:25:46,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289070272] [2022-07-14 06:25:46,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289070272] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:25:46,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705075001] [2022-07-14 06:25:46,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:25:46,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:25:46,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:25:46,260 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) [2022-07-14 06:25:46,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-14 06:25:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:46,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-14 06:25:46,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:25:46,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:25:46,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:25:46,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:25:46,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:25:46,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-07-14 06:25:46,757 INFO L356 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2022-07-14 06:25:46,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2022-07-14 06:25:46,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 36 [2022-07-14 06:25:46,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-07-14 06:25:46,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 36 [2022-07-14 06:25:46,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-07-14 06:25:46,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 36 [2022-07-14 06:25:46,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-07-14 06:25:46,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:46,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-07-14 06:25:46,998 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:47,000 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:47,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 17 [2022-07-14 06:25:47,021 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 68 proven. 11 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-14 06:25:47,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:25:47,073 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2573 (Array Int Int)) (v_ArrVal_2572 (Array Int Int))) (let ((.cse0 (+ c_append_~head.offset 4))) (<= (+ 9 (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_2573) c_append_~head.base) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_2572) c_append_~head.base) .cse0))))) (forall ((v_ArrVal_2573 (Array Int Int))) (<= 0 (+ 5 (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_2573) c_append_~head.base) (+ c_append_~head.offset 4)))))) is different from false [2022-07-14 06:25:47,379 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:47,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-14 06:25:47,381 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:47,387 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-07-14 06:25:47,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 13 [2022-07-14 06:25:47,394 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-14 06:25:47,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 1 [2022-07-14 06:25:47,538 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:47,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 49 [2022-07-14 06:25:47,543 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:47,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2022-07-14 06:25:47,551 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:47,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 71 [2022-07-14 06:25:47,560 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:47,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 105 [2022-07-14 06:25:47,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 78 [2022-07-14 06:25:47,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2022-07-14 06:25:47,678 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:47,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-14 06:25:47,681 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:47,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:25:47,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-14 06:25:47,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2022-07-14 06:25:48,465 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 68 proven. 4 refuted. 0 times theorem prover too weak. 35 trivial. 7 not checked. [2022-07-14 06:25:48,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705075001] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:25:48,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:25:48,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2022-07-14 06:25:48,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810639553] [2022-07-14 06:25:48,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:25:48,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-14 06:25:48,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:25:48,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-14 06:25:48,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=942, Unknown=1, NotChecked=62, Total=1122 [2022-07-14 06:25:48,467 INFO L87 Difference]: Start difference. First operand 452 states and 583 transitions. Second operand has 34 states, 30 states have (on average 4.066666666666666) internal successors, (122), 27 states have internal predecessors, (122), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-14 06:25:49,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:25:49,183 INFO L93 Difference]: Finished difference Result 465 states and 596 transitions. [2022-07-14 06:25:49,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 06:25:49,184 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 30 states have (on average 4.066666666666666) internal successors, (122), 27 states have internal predecessors, (122), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 2 states have call successors, (9) Word has length 88 [2022-07-14 06:25:49,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:25:49,186 INFO L225 Difference]: With dead ends: 465 [2022-07-14 06:25:49,186 INFO L226 Difference]: Without dead ends: 465 [2022-07-14 06:25:49,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 167 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=242, Invalid=1483, Unknown=1, NotChecked=80, Total=1806 [2022-07-14 06:25:49,187 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 338 mSDsluCounter, 1950 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 2247 SdHoareTripleChecker+Invalid, 2193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1255 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:25:49,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 2247 Invalid, 2193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 922 Invalid, 0 Unknown, 1255 Unchecked, 0.4s Time] [2022-07-14 06:25:49,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2022-07-14 06:25:49,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 464. [2022-07-14 06:25:49,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 327 states have (on average 1.7217125382262997) internal successors, (563), 443 states have internal predecessors, (563), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 06:25:49,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 595 transitions. [2022-07-14 06:25:49,199 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 595 transitions. Word has length 88 [2022-07-14 06:25:49,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:25:49,199 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 595 transitions. [2022-07-14 06:25:49,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 30 states have (on average 4.066666666666666) internal successors, (122), 27 states have internal predecessors, (122), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-14 06:25:49,199 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 595 transitions. [2022-07-14 06:25:49,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-14 06:25:49,204 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:25:49,204 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:25:49,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-14 06:25:49,422 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,SelfDestructingSolverStorable16 [2022-07-14 06:25:49,422 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-14 06:25:49,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:25:49,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1694546100, now seen corresponding path program 1 times [2022-07-14 06:25:49,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:25:49,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828257467] [2022-07-14 06:25:49,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:25:49,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:25:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:49,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 06:25:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:49,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 06:25:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:49,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 06:25:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:49,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 06:25:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:49,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 06:25:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:49,721 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 90 proven. 16 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-14 06:25:49,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:25:49,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828257467] [2022-07-14 06:25:49,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828257467] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:25:49,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581733636] [2022-07-14 06:25:49,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:25:49,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:25:49,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:25:49,744 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) [2022-07-14 06:25:49,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-14 06:25:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:50,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 904 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-14 06:25:50,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:25:50,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:25:50,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:25:50,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:25:50,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:25:50,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-07-14 06:25:50,303 INFO L356 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2022-07-14 06:25:50,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2022-07-14 06:25:50,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 36 [2022-07-14 06:25:50,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-07-14 06:25:50,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 36 [2022-07-14 06:25:50,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-07-14 06:25:50,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 36 [2022-07-14 06:25:50,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-07-14 06:25:50,506 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:50,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-07-14 06:25:50,509 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:50,510 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:50,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 17 [2022-07-14 06:25:50,528 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 95 proven. 11 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-14 06:25:50,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:25:50,571 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3137 (Array Int Int)) (v_ArrVal_3138 (Array Int Int))) (let ((.cse0 (+ c_append_~head.offset 4))) (<= (+ 9 (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_3138) c_append_~head.base) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_3137) c_append_~head.base) .cse0))))) (forall ((v_ArrVal_3138 (Array Int Int))) (<= 0 (+ 5 (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_3138) c_append_~head.base) (+ c_append_~head.offset 4)))))) is different from false [2022-07-14 06:25:50,826 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:50,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 49 [2022-07-14 06:25:50,832 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:50,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2022-07-14 06:25:50,833 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:50,838 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-07-14 06:25:50,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 27 [2022-07-14 06:25:50,840 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:50,841 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:50,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-07-14 06:25:50,891 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-14 06:25:50,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 1 [2022-07-14 06:25:51,022 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:51,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 49 [2022-07-14 06:25:51,027 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:51,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2022-07-14 06:25:51,033 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:51,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 71 [2022-07-14 06:25:51,041 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:51,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 105 [2022-07-14 06:25:51,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2022-07-14 06:25:51,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2022-07-14 06:25:51,173 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:25:51,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-14 06:25:51,175 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:25:51,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:25:51,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-14 06:25:51,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2022-07-14 06:25:51,981 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 95 proven. 4 refuted. 0 times theorem prover too weak. 76 trivial. 7 not checked. [2022-07-14 06:25:51,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581733636] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:25:51,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:25:51,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2022-07-14 06:25:51,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428015229] [2022-07-14 06:25:51,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:25:51,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-14 06:25:51,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:25:51,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-14 06:25:51,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=937, Unknown=2, NotChecked=62, Total=1122 [2022-07-14 06:25:51,983 INFO L87 Difference]: Start difference. First operand 464 states and 595 transitions. Second operand has 34 states, 30 states have (on average 4.066666666666666) internal successors, (122), 27 states have internal predecessors, (122), 5 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 5 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-14 06:25:53,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:25:53,545 INFO L93 Difference]: Finished difference Result 636 states and 684 transitions. [2022-07-14 06:25:53,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 06:25:53,546 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 30 states have (on average 4.066666666666666) internal successors, (122), 27 states have internal predecessors, (122), 5 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 5 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2022-07-14 06:25:53,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:25:53,547 INFO L225 Difference]: With dead ends: 636 [2022-07-14 06:25:53,547 INFO L226 Difference]: Without dead ends: 636 [2022-07-14 06:25:53,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=274, Invalid=1450, Unknown=2, NotChecked=80, Total=1806 [2022-07-14 06:25:53,548 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 820 mSDsluCounter, 2530 mSDsCounter, 0 mSdLazyCounter, 2858 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 2679 SdHoareTripleChecker+Invalid, 4526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 2858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1592 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:25:53,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 2679 Invalid, 4526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 2858 Invalid, 0 Unknown, 1592 Unchecked, 1.2s Time] [2022-07-14 06:25:53,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2022-07-14 06:25:53,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 451. [2022-07-14 06:25:53,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 315 states have (on average 1.746031746031746) internal successors, (550), 431 states have internal predecessors, (550), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 06:25:53,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 582 transitions. [2022-07-14 06:25:53,556 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 582 transitions. Word has length 105 [2022-07-14 06:25:53,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:25:53,557 INFO L495 AbstractCegarLoop]: Abstraction has 451 states and 582 transitions. [2022-07-14 06:25:53,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 30 states have (on average 4.066666666666666) internal successors, (122), 27 states have internal predecessors, (122), 5 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 5 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-14 06:25:53,557 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 582 transitions. [2022-07-14 06:25:53,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2022-07-14 06:25:53,559 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:25:53,559 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:25:53,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-14 06:25:53,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-14 06:25:53,778 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-14 06:25:53,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:25:53,778 INFO L85 PathProgramCache]: Analyzing trace with hash -365002613, now seen corresponding path program 1 times [2022-07-14 06:25:53,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:25:53,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408652642] [2022-07-14 06:25:53,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:25:53,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:25:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:55,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 06:25:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:56,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 06:25:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:56,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 06:25:56,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:56,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-14 06:25:56,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:56,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 06:25:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:57,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 06:25:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:57,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 06:25:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:57,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 06:25:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:57,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-14 06:25:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:58,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-14 06:25:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:58,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-14 06:25:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:58,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-14 06:25:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:59,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-14 06:25:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:59,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-07-14 06:25:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:25:59,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-14 06:25:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:00,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 76 proven. 942 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2022-07-14 06:26:00,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:26:00,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408652642] [2022-07-14 06:26:00,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408652642] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:26:00,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543960361] [2022-07-14 06:26:00,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:00,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:26:00,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:26:00,415 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) [2022-07-14 06:26:00,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-14 06:26:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:01,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 2276 conjuncts, 449 conjunts are in the unsatisfiable core [2022-07-14 06:26:01,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:26:01,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:26:01,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:26:01,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:26:01,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:26:01,589 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:26:01,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2022-07-14 06:26:01,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:26:01,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-07-14 06:26:01,650 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:26:01,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-07-14 06:26:01,716 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-14 06:26:01,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-14 06:26:02,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:26:02,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:26:02,268 INFO L356 Elim1Store]: treesize reduction 58, result has 33.3 percent of original size [2022-07-14 06:26:02,271 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-14 06:26:02,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-14 06:26:02,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:26:02,495 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_12| input size 58 context size 58 output size 58 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:182) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:164) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:152) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-14 06:26:02,498 INFO L158 Benchmark]: Toolchain (without parser) took 55242.04ms. Allocated memory was 104.9MB in the beginning and 673.2MB in the end (delta: 568.3MB). Free memory was 73.1MB in the beginning and 511.0MB in the end (delta: -437.9MB). Peak memory consumption was 130.2MB. Max. memory is 16.1GB. [2022-07-14 06:26:02,498 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 59.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 06:26:02,498 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.41ms. Allocated memory is still 104.9MB. Free memory was 72.9MB in the beginning and 69.2MB in the end (delta: 3.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-14 06:26:02,498 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.92ms. Allocated memory is still 104.9MB. Free memory was 69.2MB in the beginning and 66.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 06:26:02,499 INFO L158 Benchmark]: Boogie Preprocessor took 50.08ms. Allocated memory is still 104.9MB. Free memory was 66.1MB in the beginning and 63.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 06:26:02,499 INFO L158 Benchmark]: RCFGBuilder took 738.71ms. Allocated memory was 104.9MB in the beginning and 153.1MB in the end (delta: 48.2MB). Free memory was 63.7MB in the beginning and 101.2MB in the end (delta: -37.5MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2022-07-14 06:26:02,499 INFO L158 Benchmark]: TraceAbstraction took 54046.23ms. Allocated memory was 153.1MB in the beginning and 673.2MB in the end (delta: 520.1MB). Free memory was 100.5MB in the beginning and 511.0MB in the end (delta: -410.6MB). Peak memory consumption was 109.7MB. Max. memory is 16.1GB. [2022-07-14 06:26:02,500 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 59.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.41ms. Allocated memory is still 104.9MB. Free memory was 72.9MB in the beginning and 69.2MB in the end (delta: 3.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.92ms. Allocated memory is still 104.9MB. Free memory was 69.2MB in the beginning and 66.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.08ms. Allocated memory is still 104.9MB. Free memory was 66.1MB in the beginning and 63.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 738.71ms. Allocated memory was 104.9MB in the beginning and 153.1MB in the end (delta: 48.2MB). Free memory was 63.7MB in the beginning and 101.2MB in the end (delta: -37.5MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * TraceAbstraction took 54046.23ms. Allocated memory was 153.1MB in the beginning and 673.2MB in the end (delta: 520.1MB). Free memory was 100.5MB in the beginning and 511.0MB in the end (delta: -410.6MB). Peak memory consumption was 109.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_12| input size 58 context size 58 output size 58 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_BEFORE_CALL_12| input size 58 context size 58 output size 58: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-14 06:26:02,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db322df1d89bf1549765f136e3e3b8000484c0c3108c31998992cf725d6dcc20 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:26:04,213 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:26:04,214 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:26:04,247 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:26:04,248 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:26:04,249 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:26:04,253 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:26:04,255 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:26:04,257 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:26:04,261 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:26:04,262 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:26:04,266 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:26:04,266 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:26:04,267 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:26:04,268 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:26:04,271 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:26:04,272 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:26:04,272 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:26:04,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:26:04,276 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:26:04,277 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:26:04,278 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:26:04,280 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:26:04,280 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:26:04,281 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:26:04,285 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:26:04,285 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:26:04,285 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:26:04,286 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:26:04,286 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:26:04,287 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:26:04,287 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:26:04,288 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:26:04,289 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:26:04,290 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:26:04,290 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:26:04,290 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:26:04,291 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:26:04,291 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:26:04,291 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:26:04,292 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:26:04,293 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:26:04,293 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-14 06:26:04,317 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:26:04,318 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:26:04,318 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:26:04,318 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:26:04,319 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:26:04,319 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:26:04,320 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:26:04,320 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:26:04,320 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:26:04,321 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:26:04,328 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:26:04,328 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:26:04,328 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:26:04,328 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:26:04,328 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:26:04,328 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:26:04,329 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:26:04,329 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:26:04,329 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:26:04,329 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:26:04,329 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-14 06:26:04,329 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-14 06:26:04,329 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:26:04,330 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:26:04,330 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:26:04,330 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:26:04,330 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:26:04,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:26:04,330 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:26:04,331 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:26:04,331 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-14 06:26:04,331 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-14 06:26:04,331 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-14 06:26:04,331 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> db322df1d89bf1549765f136e3e3b8000484c0c3108c31998992cf725d6dcc20 [2022-07-14 06:26:04,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:26:04,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:26:04,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:26:04,708 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:26:04,709 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:26:04,710 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i [2022-07-14 06:26:04,750 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/968bdebec/bbe8a81e9b404070ab50083432646429/FLAG859b15781 [2022-07-14 06:26:05,187 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:26:05,188 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i [2022-07-14 06:26:05,205 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/968bdebec/bbe8a81e9b404070ab50083432646429/FLAG859b15781 [2022-07-14 06:26:05,217 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/968bdebec/bbe8a81e9b404070ab50083432646429 [2022-07-14 06:26:05,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:26:05,220 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:26:05,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:26:05,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:26:05,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:26:05,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:26:05" (1/1) ... [2022-07-14 06:26:05,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66b2d1eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:26:05, skipping insertion in model container [2022-07-14 06:26:05,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:26:05" (1/1) ... [2022-07-14 06:26:05,229 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:26:05,266 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:26:05,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:26:05,564 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:26:05,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:26:05,624 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:26:05,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:26:05 WrapperNode [2022-07-14 06:26:05,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:26:05,625 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:26:05,626 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:26:05,626 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:26:05,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:26:05" (1/1) ... [2022-07-14 06:26:05,648 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:26:05" (1/1) ... [2022-07-14 06:26:05,670 INFO L137 Inliner]: procedures = 126, calls = 95, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 292 [2022-07-14 06:26:05,674 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:26:05,675 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:26:05,675 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:26:05,675 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:26:05,680 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:26:05" (1/1) ... [2022-07-14 06:26:05,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:26:05" (1/1) ... [2022-07-14 06:26:05,685 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:26:05" (1/1) ... [2022-07-14 06:26:05,685 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:26:05" (1/1) ... [2022-07-14 06:26:05,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:26:05" (1/1) ... [2022-07-14 06:26:05,701 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:26:05" (1/1) ... [2022-07-14 06:26:05,702 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:26:05" (1/1) ... [2022-07-14 06:26:05,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:26:05,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:26:05,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:26:05,706 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:26:05,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:26:05" (1/1) ... [2022-07-14 06:26:05,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:26:05,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:26:05,728 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 06:26:05,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-14 06:26:05,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 06:26:05,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 06:26:05,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 06:26:05,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 06:26:05,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-14 06:26:05,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 06:26:05,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-14 06:26:05,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:26:05,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:26:05,763 INFO L130 BoogieDeclarations]: Found specification of procedure append [2022-07-14 06:26:05,763 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2022-07-14 06:26:05,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 06:26:05,855 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:26:05,856 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:26:06,786 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:26:06,792 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:26:06,792 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-07-14 06:26:06,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:26:06 BoogieIcfgContainer [2022-07-14 06:26:06,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:26:06,806 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:26:06,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:26:06,808 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:26:06,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:26:05" (1/3) ... [2022-07-14 06:26:06,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137a0dbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:26:06, skipping insertion in model container [2022-07-14 06:26:06,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:26:05" (2/3) ... [2022-07-14 06:26:06,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137a0dbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:26:06, skipping insertion in model container [2022-07-14 06:26:06,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:26:06" (3/3) ... [2022-07-14 06:26:06,810 INFO L111 eAbstractionObserver]: Analyzing ICFG split_list_test05-2.i [2022-07-14 06:26:06,819 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:26:06,821 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 147 error locations. [2022-07-14 06:26:06,863 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:26:06,868 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@688b06f7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1651acdb [2022-07-14 06:26:06,868 INFO L358 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2022-07-14 06:26:06,871 INFO L276 IsEmpty]: Start isEmpty. Operand has 320 states, 156 states have (on average 2.16025641025641) internal successors, (337), 305 states have internal predecessors, (337), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-14 06:26:06,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 06:26:06,876 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:26:06,877 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 06:26:06,878 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-14 06:26:06,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:26:06,882 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-14 06:26:06,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:26:06,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659188452] [2022-07-14 06:26:06,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:06,890 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:26:06,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:26:06,892 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:26:06,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-14 06:26:06,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:06,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 06:26:06,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:26:07,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:26:07,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:07,029 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:26:07,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:26:07,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659188452] [2022-07-14 06:26:07,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659188452] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:26:07,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:26:07,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:26:07,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909077148] [2022-07-14 06:26:07,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:26:07,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:26:07,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:26:07,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:26:07,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:26:07,077 INFO L87 Difference]: Start difference. First operand has 320 states, 156 states have (on average 2.16025641025641) internal successors, (337), 305 states have internal predecessors, (337), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:07,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:26:07,594 INFO L93 Difference]: Finished difference Result 545 states and 598 transitions. [2022-07-14 06:26:07,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:26:07,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-14 06:26:07,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:26:07,603 INFO L225 Difference]: With dead ends: 545 [2022-07-14 06:26:07,604 INFO L226 Difference]: Without dead ends: 543 [2022-07-14 06:26:07,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:26:07,606 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 246 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:26:07,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 429 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 06:26:07,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-07-14 06:26:07,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 404. [2022-07-14 06:26:07,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 243 states have (on average 2.102880658436214) internal successors, (511), 389 states have internal predecessors, (511), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-14 06:26:07,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 541 transitions. [2022-07-14 06:26:07,668 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 541 transitions. Word has length 3 [2022-07-14 06:26:07,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:26:07,668 INFO L495 AbstractCegarLoop]: Abstraction has 404 states and 541 transitions. [2022-07-14 06:26:07,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:07,668 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 541 transitions. [2022-07-14 06:26:07,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 06:26:07,669 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:26:07,669 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 06:26:07,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-14 06:26:07,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:26:07,876 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-14 06:26:07,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:26:07,876 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-14 06:26:07,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:26:07,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1270650348] [2022-07-14 06:26:07,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:07,877 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:26:07,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:26:07,892 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:26:07,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-14 06:26:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:07,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:26:07,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:26:07,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:26:07,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:07,969 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:26:07,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:26:07,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1270650348] [2022-07-14 06:26:07,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1270650348] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:26:07,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:26:07,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:26:07,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356242636] [2022-07-14 06:26:07,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:26:07,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:26:07,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:26:07,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:26:07,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:26:07,976 INFO L87 Difference]: Start difference. First operand 404 states and 541 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:08,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:26:08,370 INFO L93 Difference]: Finished difference Result 405 states and 544 transitions. [2022-07-14 06:26:08,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:26:08,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-14 06:26:08,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:26:08,373 INFO L225 Difference]: With dead ends: 405 [2022-07-14 06:26:08,373 INFO L226 Difference]: Without dead ends: 405 [2022-07-14 06:26:08,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:26:08,374 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 6 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:26:08,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 547 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:26:08,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-07-14 06:26:08,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 402. [2022-07-14 06:26:08,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 243 states have (on average 2.094650205761317) internal successors, (509), 387 states have internal predecessors, (509), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-14 06:26:08,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 539 transitions. [2022-07-14 06:26:08,393 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 539 transitions. Word has length 3 [2022-07-14 06:26:08,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:26:08,394 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 539 transitions. [2022-07-14 06:26:08,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:26:08,394 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 539 transitions. [2022-07-14 06:26:08,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 06:26:08,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:26:08,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:26:08,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-14 06:26:08,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:26:08,602 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-14 06:26:08,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:26:08,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1117383211, now seen corresponding path program 1 times [2022-07-14 06:26:08,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:26:08,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1837189931] [2022-07-14 06:26:08,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:08,604 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:26:08,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:26:08,613 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:26:08,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-14 06:26:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:08,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 06:26:08,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:26:08,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:26:08,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:08,718 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:26:08,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:26:08,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1837189931] [2022-07-14 06:26:08,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1837189931] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:26:08,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:26:08,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:26:08,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177462801] [2022-07-14 06:26:08,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:26:08,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:26:08,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:26:08,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:26:08,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:26:08,719 INFO L87 Difference]: Start difference. First operand 402 states and 539 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2022-07-14 06:26:09,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:26:09,026 INFO L93 Difference]: Finished difference Result 397 states and 534 transitions. [2022-07-14 06:26:09,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:26:09,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2022-07-14 06:26:09,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:26:09,029 INFO L225 Difference]: With dead ends: 397 [2022-07-14 06:26:09,029 INFO L226 Difference]: Without dead ends: 397 [2022-07-14 06:26:09,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:26:09,030 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 43 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:26:09,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 490 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:26:09,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-07-14 06:26:09,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2022-07-14 06:26:09,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 243 states have (on average 2.074074074074074) internal successors, (504), 382 states have internal predecessors, (504), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-14 06:26:09,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 534 transitions. [2022-07-14 06:26:09,038 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 534 transitions. Word has length 10 [2022-07-14 06:26:09,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:26:09,038 INFO L495 AbstractCegarLoop]: Abstraction has 397 states and 534 transitions. [2022-07-14 06:26:09,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2022-07-14 06:26:09,039 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 534 transitions. [2022-07-14 06:26:09,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 06:26:09,039 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:26:09,039 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:26:09,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-14 06:26:09,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:26:09,247 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-14 06:26:09,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:26:09,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1117383212, now seen corresponding path program 1 times [2022-07-14 06:26:09,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:26:09,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [301792092] [2022-07-14 06:26:09,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:09,248 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:26:09,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:26:09,253 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:26:09,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-14 06:26:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:09,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:26:09,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:26:09,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:26:09,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:09,353 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:26:09,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:26:09,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [301792092] [2022-07-14 06:26:09,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [301792092] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:26:09,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:26:09,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:26:09,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906319202] [2022-07-14 06:26:09,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:26:09,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:26:09,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:26:09,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:26:09,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:26:09,355 INFO L87 Difference]: Start difference. First operand 397 states and 534 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2022-07-14 06:26:09,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:26:09,707 INFO L93 Difference]: Finished difference Result 392 states and 529 transitions. [2022-07-14 06:26:09,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:26:09,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2022-07-14 06:26:09,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:26:09,710 INFO L225 Difference]: With dead ends: 392 [2022-07-14 06:26:09,710 INFO L226 Difference]: Without dead ends: 392 [2022-07-14 06:26:09,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:26:09,711 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 38 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:26:09,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 503 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:26:09,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2022-07-14 06:26:09,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2022-07-14 06:26:09,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 243 states have (on average 2.0534979423868314) internal successors, (499), 377 states have internal predecessors, (499), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-14 06:26:09,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 529 transitions. [2022-07-14 06:26:09,719 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 529 transitions. Word has length 10 [2022-07-14 06:26:09,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:26:09,719 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 529 transitions. [2022-07-14 06:26:09,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2022-07-14 06:26:09,719 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 529 transitions. [2022-07-14 06:26:09,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 06:26:09,720 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:26:09,720 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:26:09,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-14 06:26:09,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:26:09,930 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-14 06:26:09,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:26:09,930 INFO L85 PathProgramCache]: Analyzing trace with hash 279141591, now seen corresponding path program 1 times [2022-07-14 06:26:09,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:26:09,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102704287] [2022-07-14 06:26:09,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:09,931 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:26:09,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:26:09,932 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:26:09,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-14 06:26:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:10,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 06:26:10,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:26:10,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:26:10,050 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-14 06:26:10,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-14 06:26:10,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:10,065 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:26:10,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:26:10,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102704287] [2022-07-14 06:26:10,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102704287] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:26:10,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:26:10,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:26:10,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147069915] [2022-07-14 06:26:10,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:26:10,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:26:10,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:26:10,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:26:10,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:26:10,067 INFO L87 Difference]: Start difference. First operand 392 states and 529 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) [2022-07-14 06:26:10,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:26:10,689 INFO L93 Difference]: Finished difference Result 520 states and 571 transitions. [2022-07-14 06:26:10,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:26:10,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 11 [2022-07-14 06:26:10,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:26:10,691 INFO L225 Difference]: With dead ends: 520 [2022-07-14 06:26:10,691 INFO L226 Difference]: Without dead ends: 520 [2022-07-14 06:26:10,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:26:10,692 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 314 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:26:10,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 632 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-14 06:26:10,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-07-14 06:26:10,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 384. [2022-07-14 06:26:10,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 243 states have (on average 2.0205761316872426) internal successors, (491), 369 states have internal predecessors, (491), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-14 06:26:10,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 521 transitions. [2022-07-14 06:26:10,698 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 521 transitions. Word has length 11 [2022-07-14 06:26:10,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:26:10,699 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 521 transitions. [2022-07-14 06:26:10,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) [2022-07-14 06:26:10,699 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 521 transitions. [2022-07-14 06:26:10,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 06:26:10,699 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:26:10,699 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:26:10,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-14 06:26:10,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:26:10,900 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-14 06:26:10,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:26:10,900 INFO L85 PathProgramCache]: Analyzing trace with hash 279141592, now seen corresponding path program 1 times [2022-07-14 06:26:10,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:26:10,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137193544] [2022-07-14 06:26:10,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:10,901 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:26:10,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:26:10,904 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:26:10,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-14 06:26:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:11,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-14 06:26:11,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:26:11,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:26:11,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:26:11,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:26:11,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:26:11,136 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:26:11,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-14 06:26:11,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:11,157 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:26:11,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:26:11,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137193544] [2022-07-14 06:26:11,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [137193544] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:26:11,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:26:11,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:26:11,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330046421] [2022-07-14 06:26:11,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:26:11,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:26:11,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:26:11,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:26:11,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:26:11,159 INFO L87 Difference]: Start difference. First operand 384 states and 521 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) [2022-07-14 06:26:12,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:26:12,124 INFO L93 Difference]: Finished difference Result 511 states and 562 transitions. [2022-07-14 06:26:12,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:26:12,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 11 [2022-07-14 06:26:12,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:26:12,126 INFO L225 Difference]: With dead ends: 511 [2022-07-14 06:26:12,126 INFO L226 Difference]: Without dead ends: 511 [2022-07-14 06:26:12,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:26:12,127 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 298 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 06:26:12,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 436 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-14 06:26:12,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2022-07-14 06:26:12,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 376. [2022-07-14 06:26:12,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 243 states have (on average 1.9835390946502058) internal successors, (482), 361 states have internal predecessors, (482), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-14 06:26:12,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 512 transitions. [2022-07-14 06:26:12,138 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 512 transitions. Word has length 11 [2022-07-14 06:26:12,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:26:12,138 INFO L495 AbstractCegarLoop]: Abstraction has 376 states and 512 transitions. [2022-07-14 06:26:12,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) [2022-07-14 06:26:12,138 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 512 transitions. [2022-07-14 06:26:12,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 06:26:12,139 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:26:12,139 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:26:12,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-14 06:26:12,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:26:12,340 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-14 06:26:12,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:26:12,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1241205510, now seen corresponding path program 1 times [2022-07-14 06:26:12,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:26:12,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437427182] [2022-07-14 06:26:12,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:12,340 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:26:12,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:26:12,345 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:26:12,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-14 06:26:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:12,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-14 06:26:12,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:26:12,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:26:12,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:26:12,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:26:12,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:26:12,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:26:12,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:26:12,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:26:12,584 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:26:12,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-14 06:26:12,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:26:12,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:26:12,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:26:12,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:26:12,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:12,680 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:26:12,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:26:12,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [437427182] [2022-07-14 06:26:12,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [437427182] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:26:12,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:26:12,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 06:26:12,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740444460] [2022-07-14 06:26:12,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:26:12,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:26:12,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:26:12,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:26:12,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:26:12,681 INFO L87 Difference]: Start difference. First operand 376 states and 512 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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) [2022-07-14 06:26:13,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:26:13,319 INFO L93 Difference]: Finished difference Result 396 states and 535 transitions. [2022-07-14 06:26:13,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:26:13,319 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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 20 [2022-07-14 06:26:13,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:26:13,321 INFO L225 Difference]: With dead ends: 396 [2022-07-14 06:26:13,321 INFO L226 Difference]: Without dead ends: 396 [2022-07-14 06:26:13,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:26:13,321 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 25 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1821 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:26:13,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1821 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-14 06:26:13,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-07-14 06:26:13,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 384. [2022-07-14 06:26:13,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 250 states have (on average 1.96) internal successors, (490), 368 states have internal predecessors, (490), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 06:26:13,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 522 transitions. [2022-07-14 06:26:13,328 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 522 transitions. Word has length 20 [2022-07-14 06:26:13,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:26:13,328 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 522 transitions. [2022-07-14 06:26:13,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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) [2022-07-14 06:26:13,329 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 522 transitions. [2022-07-14 06:26:13,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 06:26:13,329 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:26:13,329 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:26:13,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-14 06:26:13,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:26:13,535 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-14 06:26:13,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:26:13,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1158865353, now seen corresponding path program 1 times [2022-07-14 06:26:13,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:26:13,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [79854310] [2022-07-14 06:26:13,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:13,536 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:26:13,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:26:13,537 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:26:13,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-14 06:26:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:13,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 06:26:13,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:26:13,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:26:13,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:26:13,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:26:13,751 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:26:13,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-14 06:26:13,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:26:13,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:26:13,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-14 06:26:13,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-14 06:26:13,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:13,852 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:26:13,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:26:13,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [79854310] [2022-07-14 06:26:13,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [79854310] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:26:13,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:26:13,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 06:26:13,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597136164] [2022-07-14 06:26:13,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:26:13,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:26:13,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:26:13,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:26:13,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:26:13,854 INFO L87 Difference]: Start difference. First operand 384 states and 522 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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) [2022-07-14 06:26:14,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:26:14,917 INFO L93 Difference]: Finished difference Result 524 states and 577 transitions. [2022-07-14 06:26:14,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:26:14,918 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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 22 [2022-07-14 06:26:14,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:26:14,919 INFO L225 Difference]: With dead ends: 524 [2022-07-14 06:26:14,919 INFO L226 Difference]: Without dead ends: 524 [2022-07-14 06:26:14,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:26:14,920 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 249 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:26:14,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 1331 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-14 06:26:14,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-07-14 06:26:14,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 387. [2022-07-14 06:26:14,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 253 states have (on average 1.948616600790514) internal successors, (493), 371 states have internal predecessors, (493), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 06:26:14,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 525 transitions. [2022-07-14 06:26:14,926 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 525 transitions. Word has length 22 [2022-07-14 06:26:14,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:26:14,927 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 525 transitions. [2022-07-14 06:26:14,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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) [2022-07-14 06:26:14,927 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 525 transitions. [2022-07-14 06:26:14,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-14 06:26:14,928 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:26:14,929 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:26:14,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-14 06:26:15,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:26:15,137 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-14 06:26:15,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:26:15,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1480107696, now seen corresponding path program 1 times [2022-07-14 06:26:15,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:26:15,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1234897555] [2022-07-14 06:26:15,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:15,138 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:26:15,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:26:15,140 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:26:15,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-14 06:26:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:15,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-14 06:26:15,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:26:15,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:26:15,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:26:15,482 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:26:15,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-14 06:26:15,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-14 06:26:15,541 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:26:15,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 06:26:15,631 INFO L356 Elim1Store]: treesize reduction 75, result has 15.7 percent of original size [2022-07-14 06:26:15,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 45 treesize of output 76 [2022-07-14 06:26:15,641 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-07-14 06:26:15,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 20 [2022-07-14 06:26:15,725 INFO L356 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2022-07-14 06:26:15,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 52 [2022-07-14 06:26:15,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2022-07-14 06:26:15,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2022-07-14 06:26:15,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2022-07-14 06:26:15,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2022-07-14 06:26:15,921 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:15,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:26:15,968 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_252 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_252) c_append_~head.base) (bvadd (_ bv4 32) c_append_~head.offset))) (_ bv1 1))) is different from false [2022-07-14 06:26:16,019 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_252 (Array (_ BitVec 32) (_ BitVec 32))) (v_append_~node~0.base_21 (_ BitVec 32)) (v_ArrVal_249 (_ BitVec 1))) (or (= (select (store |c_#valid| v_append_~node~0.base_21 v_ArrVal_249) (select (select (store |c_#memory_$Pointer$.base| v_append_~node~0.base_21 v_ArrVal_252) |c_append_#in~head.base|) (bvadd (_ bv4 32) |c_append_#in~head.offset|))) (_ bv1 1)) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_append_~node~0.base_21)))))) is different from false [2022-07-14 06:26:16,029 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_252 (Array (_ BitVec 32) (_ BitVec 32))) (v_append_~node~0.base_21 (_ BitVec 32)) (v_ArrVal_249 (_ BitVec 1))) (or (= (select (store |c_#valid| v_append_~node~0.base_21 v_ArrVal_249) (select (select (store |c_#memory_$Pointer$.base| v_append_~node~0.base_21 v_ArrVal_252) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (_ bv1 1)) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_append_~node~0.base_21)))))) is different from false [2022-07-14 06:26:16,140 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:16,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-07-14 06:26:16,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 335 treesize of output 209 [2022-07-14 06:26:16,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 166 [2022-07-14 06:26:16,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 158 [2022-07-14 06:26:20,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:26:20,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1234897555] [2022-07-14 06:26:20,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1234897555] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:26:20,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2118937287] [2022-07-14 06:26:20,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:20,340 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 06:26:20,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 06:26:20,347 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 06:26:20,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-07-14 06:26:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:20,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-14 06:26:20,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:26:20,695 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-14 06:26:20,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-14 06:26:20,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:26:20,831 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:26:20,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-14 06:26:20,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-14 06:26:20,866 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:26:20,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 06:26:20,937 INFO L356 Elim1Store]: treesize reduction 128, result has 20.5 percent of original size [2022-07-14 06:26:20,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 52 treesize of output 99 [2022-07-14 06:26:20,948 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-07-14 06:26:20,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 45 treesize of output 20 [2022-07-14 06:26:21,096 INFO L356 Elim1Store]: treesize reduction 65, result has 40.9 percent of original size [2022-07-14 06:26:21,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 case distinctions, treesize of input 34 treesize of output 65 [2022-07-14 06:26:21,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2022-07-14 06:26:21,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2022-07-14 06:26:21,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2022-07-14 06:26:21,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2022-07-14 06:26:21,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:21,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:26:21,415 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_336) c_append_~head.base) (bvadd (_ bv4 32) c_append_~head.offset))) (_ bv1 1))) is different from false [2022-07-14 06:26:21,445 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_append_~node~0.base_25 (_ BitVec 32)) (v_ArrVal_333 (_ BitVec 1)) (v_ArrVal_336 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_append_~node~0.base_25)))) (= (select (store |c_#valid| v_append_~node~0.base_25 v_ArrVal_333) (select (select (store |c_#memory_$Pointer$.base| v_append_~node~0.base_25 v_ArrVal_336) |c_append_#in~head.base|) (bvadd (_ bv4 32) |c_append_#in~head.offset|))) (_ bv1 1)))) is different from false [2022-07-14 06:26:21,457 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_append_~node~0.base_25 (_ BitVec 32)) (v_ArrVal_333 (_ BitVec 1)) (v_ArrVal_336 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_append_~node~0.base_25)))) (= (select (store |c_#valid| v_append_~node~0.base_25 v_ArrVal_333) (select (select (store |c_#memory_$Pointer$.base| v_append_~node~0.base_25 v_ArrVal_336) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (_ bv1 1)))) is different from false [2022-07-14 06:26:21,585 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:21,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-07-14 06:26:21,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 334 treesize of output 208 [2022-07-14 06:26:21,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 174 [2022-07-14 06:26:21,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 158 [2022-07-14 06:26:25,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2118937287] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:26:25,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:26:25,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2022-07-14 06:26:25,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250948593] [2022-07-14 06:26:25,752 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:26:25,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-14 06:26:25,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:26:25,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-14 06:26:25,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=480, Unknown=7, NotChecked=294, Total=870 [2022-07-14 06:26:25,753 INFO L87 Difference]: Start difference. First operand 387 states and 525 transitions. Second operand has 21 states, 20 states have (on average 3.05) internal successors, (61), 18 states have internal predecessors, (61), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:26:28,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:26:28,174 INFO L93 Difference]: Finished difference Result 529 states and 595 transitions. [2022-07-14 06:26:28,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 06:26:28,175 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.05) internal successors, (61), 18 states have internal predecessors, (61), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2022-07-14 06:26:28,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:26:28,177 INFO L225 Difference]: With dead ends: 529 [2022-07-14 06:26:28,177 INFO L226 Difference]: Without dead ends: 529 [2022-07-14 06:26:28,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=195, Invalid=944, Unknown=7, NotChecked=414, Total=1560 [2022-07-14 06:26:28,178 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 587 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 1927 SdHoareTripleChecker+Invalid, 2067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-14 06:26:28,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 1927 Invalid, 2067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1752 Invalid, 0 Unknown, 171 Unchecked, 1.9s Time] [2022-07-14 06:26:28,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2022-07-14 06:26:28,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 392. [2022-07-14 06:26:28,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 258 states have (on average 1.926356589147287) internal successors, (497), 376 states have internal predecessors, (497), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 06:26:28,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 529 transitions. [2022-07-14 06:26:28,203 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 529 transitions. Word has length 36 [2022-07-14 06:26:28,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:26:28,204 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 529 transitions. [2022-07-14 06:26:28,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.05) internal successors, (61), 18 states have internal predecessors, (61), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:26:28,205 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 529 transitions. [2022-07-14 06:26:28,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-14 06:26:28,208 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:26:28,208 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:26:28,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2022-07-14 06:26:28,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-14 06:26:28,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:26:28,613 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2022-07-14 06:26:28,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:26:28,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1480107697, now seen corresponding path program 1 times [2022-07-14 06:26:28,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:26:28,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1127112112] [2022-07-14 06:26:28,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:26:28,613 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:26:28,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:26:28,614 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:26:28,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-14 06:26:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:26:28,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-14 06:26:28,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:26:28,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:26:28,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:26:28,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:26:28,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:26:28,972 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:26:28,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-14 06:26:28,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-14 06:26:28,998 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:26:28,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-14 06:26:29,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-14 06:26:29,104 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:26:29,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 06:26:29,117 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:26:29,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2022-07-14 06:26:29,221 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-07-14 06:26:29,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 51 [2022-07-14 06:26:29,304 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:26:29,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-14 06:26:29,322 INFO L356 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-07-14 06:26:29,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:26:29,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-07-14 06:26:29,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:26:29,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:26:29,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-07-14 06:26:29,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-07-14 06:26:29,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:26:29,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-14 06:26:29,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-14 06:26:29,584 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:26:29,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:26:29,745 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_426 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_427 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) c_append_~head.offset))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_427) c_append_~head.base) .cse0) (_ bv9 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_426) c_append_~head.base) .cse0))))) (forall ((v_ArrVal_427 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_427) c_append_~head.base) (bvadd (_ bv4 32) c_append_~head.offset)))) (bvule (bvadd .cse1 (_ bv5 32)) (bvadd .cse1 (_ bv9 32)))))) is different from false [2022-07-14 06:26:32,015 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_append_~node~0.base_29 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_append_~node~0.base_29)))) (and (forall ((v_ArrVal_427 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| v_append_~node~0.base_29 v_ArrVal_427) |c_append_#in~head.base|) (bvadd (_ bv4 32) |c_append_#in~head.offset|)))) (bvule (bvadd .cse0 (_ bv5 32)) (bvadd .cse0 (_ bv9 32))))) (forall ((v_ArrVal_426 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_427 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) |c_append_#in~head.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| v_append_~node~0.base_29 v_ArrVal_427) |c_append_#in~head.base|) .cse1) (_ bv9 32)) (select (store |c_#length| v_append_~node~0.base_29 (_ bv9 32)) (select (select (store |c_#memory_$Pointer$.base| v_append_~node~0.base_29 v_ArrVal_426) |c_append_#in~head.base|) .cse1)))))))) is different from false [2022-07-14 06:26:34,603 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:34,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 42 [2022-07-14 06:26:34,611 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:26:34,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 36 [2022-07-14 06:26:34,638 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-14 06:26:34,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 1 [2022-07-14 06:26:34,645 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:26:34,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2022-07-14 06:26:35,622 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:35,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 55 [2022-07-14 06:26:35,634 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:35,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 45 [2022-07-14 06:26:35,707 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:35,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 292 treesize of output 289 [2022-07-14 06:26:35,805 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:26:35,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 880 treesize of output 841 [2022-07-14 06:26:35,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 822 treesize of output 790 [2022-07-14 06:26:35,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 790 treesize of output 726 [2022-07-14 06:26:35,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 726 treesize of output 662 [2022-07-14 06:26:35,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 662 treesize of output 630 [2022-07-14 06:27:35,060 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:35,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 42 [2022-07-14 06:27:35,105 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:35,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 101 [2022-07-14 06:27:35,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 66 [2022-07-14 06:27:35,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2022-07-14 06:27:46,253 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:46,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 55 [2022-07-14 06:27:46,304 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:46,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 45 [2022-07-14 06:27:46,483 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:46,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 292 treesize of output 289 [2022-07-14 06:27:46,720 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:46,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1760 treesize of output 1673 [2022-07-14 06:27:46,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 827 treesize of output 763 [2022-07-14 06:27:46,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1590 treesize of output 1526 [2022-07-14 06:27:46,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1526 treesize of output 1398 [2022-07-14 06:27:46,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1398 treesize of output 1270