./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 eb692b52 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-?-eb692b5 [2022-07-20 05:47:19,635 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:47:19,637 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:47:19,676 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:47:19,676 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:47:19,677 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:47:19,679 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:47:19,681 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:47:19,682 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:47:19,686 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:47:19,687 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:47:19,689 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:47:19,689 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:47:19,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:47:19,692 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:47:19,694 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:47:19,695 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:47:19,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:47:19,698 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:47:19,704 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:47:19,706 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:47:19,707 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:47:19,708 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:47:19,709 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:47:19,710 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:47:19,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:47:19,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:47:19,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:47:19,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:47:19,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:47:19,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:47:19,720 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:47:19,721 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:47:19,721 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:47:19,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:47:19,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:47:19,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:47:19,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:47:19,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:47:19,724 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:47:19,725 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:47:19,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:47:19,727 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 05:47:19,760 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:47:19,762 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:47:19,763 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:47:19,763 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:47:19,763 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:47:19,764 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:47:19,764 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:47:19,764 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:47:19,765 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:47:19,765 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:47:19,766 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:47:19,766 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:47:19,766 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:47:19,766 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:47:19,766 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:47:19,766 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:47:19,767 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:47:19,767 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 05:47:19,767 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:47:19,767 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:47:19,767 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:47:19,768 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:47:19,768 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:47:19,768 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:47:19,768 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:47:19,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:47:19,769 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:47:19,769 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:47:19,769 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 05:47:19,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 05:47:19,770 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-20 05:47:20,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:47:20,040 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:47:20,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:47:20,044 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:47:20,045 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:47:20,047 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-20 05:47:20,123 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56ad022d1/eaafa844a2874f9a9764fd7eb639e291/FLAGf4df8e44b [2022-07-20 05:47:20,563 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:47:20,564 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i [2022-07-20 05:47:20,586 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56ad022d1/eaafa844a2874f9a9764fd7eb639e291/FLAGf4df8e44b [2022-07-20 05:47:20,913 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56ad022d1/eaafa844a2874f9a9764fd7eb639e291 [2022-07-20 05:47:20,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:47:20,918 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:47:20,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:47:20,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:47:20,922 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:47:20,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:47:20" (1/1) ... [2022-07-20 05:47:20,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a536390 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:20, skipping insertion in model container [2022-07-20 05:47:20,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:47:20" (1/1) ... [2022-07-20 05:47:20,930 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:47:20,957 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:47:21,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:47:21,276 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 05:47:21,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:47:21,356 INFO L208 MainTranslator]: Completed translation [2022-07-20 05:47:21,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:21 WrapperNode [2022-07-20 05:47:21,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:47:21,358 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 05:47:21,358 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 05:47:21,360 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 05:47:21,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:21" (1/1) ... [2022-07-20 05:47:21,393 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:21" (1/1) ... [2022-07-20 05:47:21,426 INFO L137 Inliner]: procedures = 125, calls = 95, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 302 [2022-07-20 05:47:21,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 05:47:21,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 05:47:21,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 05:47:21,428 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 05:47:21,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:21" (1/1) ... [2022-07-20 05:47:21,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:21" (1/1) ... [2022-07-20 05:47:21,440 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:21" (1/1) ... [2022-07-20 05:47:21,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:21" (1/1) ... [2022-07-20 05:47:21,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:21" (1/1) ... [2022-07-20 05:47:21,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:21" (1/1) ... [2022-07-20 05:47:21,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:21" (1/1) ... [2022-07-20 05:47:21,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 05:47:21,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 05:47:21,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 05:47:21,470 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 05:47:21,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:21" (1/1) ... [2022-07-20 05:47:21,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:47:21,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:47:21,503 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-20 05:47:21,505 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-20 05:47:21,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 05:47:21,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 05:47:21,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 05:47:21,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 05:47:21,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 05:47:21,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 05:47:21,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 05:47:21,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 05:47:21,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 05:47:21,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 05:47:21,533 INFO L130 BoogieDeclarations]: Found specification of procedure append [2022-07-20 05:47:21,533 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2022-07-20 05:47:21,628 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 05:47:21,630 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 05:47:22,233 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 05:47:22,242 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 05:47:22,242 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-07-20 05:47:22,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:47:22 BoogieIcfgContainer [2022-07-20 05:47:22,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 05:47:22,246 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 05:47:22,247 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 05:47:22,250 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 05:47:22,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:47:20" (1/3) ... [2022-07-20 05:47:22,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@440d2215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:47:22, skipping insertion in model container [2022-07-20 05:47:22,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:21" (2/3) ... [2022-07-20 05:47:22,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@440d2215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:47:22, skipping insertion in model container [2022-07-20 05:47:22,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:47:22" (3/3) ... [2022-07-20 05:47:22,252 INFO L111 eAbstractionObserver]: Analyzing ICFG split_list_test05-2.i [2022-07-20 05:47:22,264 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 05:47:22,265 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 147 error locations. [2022-07-20 05:47:22,315 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 05:47:22,321 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@755417b0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@323ca72 [2022-07-20 05:47:22,322 INFO L358 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2022-07-20 05:47:22,328 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-20 05:47:22,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 05:47:22,340 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:22,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 05:47:22,341 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-20 05:47:22,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:22,348 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-20 05:47:22,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:22,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600799631] [2022-07-20 05:47:22,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:22,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:22,503 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-20 05:47:22,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:22,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600799631] [2022-07-20 05:47:22,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600799631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:22,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:22,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:47:22,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117267861] [2022-07-20 05:47:22,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:22,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:47:22,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:22,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:47:22,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:47:22,540 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-20 05:47:22,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:22,926 INFO L93 Difference]: Finished difference Result 548 states and 601 transitions. [2022-07-20 05:47:22,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:47:22,928 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-20 05:47:22,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:22,938 INFO L225 Difference]: With dead ends: 548 [2022-07-20 05:47:22,938 INFO L226 Difference]: Without dead ends: 546 [2022-07-20 05:47:22,940 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-20 05:47:22,942 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:22,943 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.3s Time] [2022-07-20 05:47:22,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-07-20 05:47:22,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 407. [2022-07-20 05:47:22,991 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-20 05:47:22,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 544 transitions. [2022-07-20 05:47:22,995 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 544 transitions. Word has length 3 [2022-07-20 05:47:22,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:22,995 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 544 transitions. [2022-07-20 05:47:22,995 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-20 05:47:22,996 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 544 transitions. [2022-07-20 05:47:22,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 05:47:22,996 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:22,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 05:47:22,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 05:47:22,997 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-20 05:47:22,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:22,997 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-20 05:47:22,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:22,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584358928] [2022-07-20 05:47:22,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:22,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:23,030 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-20 05:47:23,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:23,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584358928] [2022-07-20 05:47:23,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584358928] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:23,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:23,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:47:23,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067525051] [2022-07-20 05:47:23,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:23,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:47:23,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:23,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:47:23,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:47:23,034 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-20 05:47:23,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:23,205 INFO L93 Difference]: Finished difference Result 408 states and 547 transitions. [2022-07-20 05:47:23,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:47:23,207 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-20 05:47:23,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:23,209 INFO L225 Difference]: With dead ends: 408 [2022-07-20 05:47:23,209 INFO L226 Difference]: Without dead ends: 408 [2022-07-20 05:47:23,212 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-20 05:47:23,214 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.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:23,215 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.2s Time] [2022-07-20 05:47:23,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-07-20 05:47:23,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 405. [2022-07-20 05:47:23,233 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-20 05:47:23,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 542 transitions. [2022-07-20 05:47:23,236 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 542 transitions. Word has length 3 [2022-07-20 05:47:23,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:23,236 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 542 transitions. [2022-07-20 05:47:23,236 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-20 05:47:23,237 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 542 transitions. [2022-07-20 05:47:23,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-20 05:47:23,237 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:23,237 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:23,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 05:47:23,238 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-20 05:47:23,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:23,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1117386190, now seen corresponding path program 1 times [2022-07-20 05:47:23,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:23,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447721859] [2022-07-20 05:47:23,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:23,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:23,280 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-20 05:47:23,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:23,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447721859] [2022-07-20 05:47:23,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447721859] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:23,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:23,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:47:23,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097364935] [2022-07-20 05:47:23,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:23,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:47:23,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:23,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:47:23,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:47:23,283 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-20 05:47:23,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:23,478 INFO L93 Difference]: Finished difference Result 400 states and 537 transitions. [2022-07-20 05:47:23,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:47:23,478 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-20 05:47:23,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:23,480 INFO L225 Difference]: With dead ends: 400 [2022-07-20 05:47:23,481 INFO L226 Difference]: Without dead ends: 400 [2022-07-20 05:47:23,481 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-20 05:47:23,482 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.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:23,482 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.2s Time] [2022-07-20 05:47:23,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-07-20 05:47:23,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2022-07-20 05:47:23,497 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-20 05:47:23,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 537 transitions. [2022-07-20 05:47:23,500 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 537 transitions. Word has length 10 [2022-07-20 05:47:23,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:23,500 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 537 transitions. [2022-07-20 05:47:23,501 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-20 05:47:23,501 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 537 transitions. [2022-07-20 05:47:23,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-20 05:47:23,501 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:23,502 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:23,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 05:47:23,502 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-20 05:47:23,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:23,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1117386191, now seen corresponding path program 1 times [2022-07-20 05:47:23,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:23,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650779871] [2022-07-20 05:47:23,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:23,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:23,548 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-20 05:47:23,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:23,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650779871] [2022-07-20 05:47:23,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650779871] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:23,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:23,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:47:23,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621010630] [2022-07-20 05:47:23,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:23,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:47:23,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:23,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:47:23,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:47:23,551 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-20 05:47:23,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:23,725 INFO L93 Difference]: Finished difference Result 395 states and 532 transitions. [2022-07-20 05:47:23,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:47:23,726 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-20 05:47:23,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:23,728 INFO L225 Difference]: With dead ends: 395 [2022-07-20 05:47:23,728 INFO L226 Difference]: Without dead ends: 395 [2022-07-20 05:47:23,728 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-20 05:47:23,729 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.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:23,730 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.2s Time] [2022-07-20 05:47:23,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-07-20 05:47:23,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2022-07-20 05:47:23,736 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-20 05:47:23,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 532 transitions. [2022-07-20 05:47:23,738 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 532 transitions. Word has length 10 [2022-07-20 05:47:23,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:23,739 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 532 transitions. [2022-07-20 05:47:23,739 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-20 05:47:23,739 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 532 transitions. [2022-07-20 05:47:23,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 05:47:23,739 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:23,740 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:23,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 05:47:23,740 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-20 05:47:23,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:23,741 INFO L85 PathProgramCache]: Analyzing trace with hash 279233943, now seen corresponding path program 1 times [2022-07-20 05:47:23,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:23,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886996135] [2022-07-20 05:47:23,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:23,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:23,806 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-20 05:47:23,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:23,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886996135] [2022-07-20 05:47:23,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886996135] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:23,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:23,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:47:23,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353616092] [2022-07-20 05:47:23,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:23,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:47:23,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:23,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:47:23,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:47:23,810 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-20 05:47:24,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:24,315 INFO L93 Difference]: Finished difference Result 523 states and 574 transitions. [2022-07-20 05:47:24,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:47:24,316 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-20 05:47:24,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:24,318 INFO L225 Difference]: With dead ends: 523 [2022-07-20 05:47:24,318 INFO L226 Difference]: Without dead ends: 523 [2022-07-20 05:47:24,318 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-20 05:47:24,319 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 318 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:24,320 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.5s Time] [2022-07-20 05:47:24,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-07-20 05:47:24,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 387. [2022-07-20 05:47:24,327 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-20 05:47:24,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 524 transitions. [2022-07-20 05:47:24,329 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 524 transitions. Word has length 11 [2022-07-20 05:47:24,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:24,329 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 524 transitions. [2022-07-20 05:47:24,330 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-20 05:47:24,330 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 524 transitions. [2022-07-20 05:47:24,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 05:47:24,330 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:24,331 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:24,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 05:47:24,331 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-20 05:47:24,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:24,332 INFO L85 PathProgramCache]: Analyzing trace with hash 279233944, now seen corresponding path program 1 times [2022-07-20 05:47:24,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:24,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975365838] [2022-07-20 05:47:24,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:24,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:24,411 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-20 05:47:24,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:24,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975365838] [2022-07-20 05:47:24,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975365838] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:24,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:24,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:47:24,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134776253] [2022-07-20 05:47:24,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:24,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:47:24,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:24,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:47:24,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:47:24,414 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-20 05:47:24,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:24,967 INFO L93 Difference]: Finished difference Result 513 states and 564 transitions. [2022-07-20 05:47:24,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:47:24,967 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-20 05:47:24,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:24,969 INFO L225 Difference]: With dead ends: 513 [2022-07-20 05:47:24,969 INFO L226 Difference]: Without dead ends: 513 [2022-07-20 05:47:24,970 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-20 05:47:24,970 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-20 05:47:24,971 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-20 05:47:24,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2022-07-20 05:47:24,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 378. [2022-07-20 05:47:24,976 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-20 05:47:24,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 514 transitions. [2022-07-20 05:47:24,978 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 514 transitions. Word has length 11 [2022-07-20 05:47:24,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:24,978 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 514 transitions. [2022-07-20 05:47:24,978 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-20 05:47:24,978 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 514 transitions. [2022-07-20 05:47:24,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 05:47:24,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:24,979 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-20 05:47:24,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 05:47:24,979 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-20 05:47:24,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:24,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1620146378, now seen corresponding path program 1 times [2022-07-20 05:47:24,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:24,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992689099] [2022-07-20 05:47:24,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:24,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:25,145 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-20 05:47:25,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:25,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992689099] [2022-07-20 05:47:25,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992689099] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:25,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:25,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 05:47:25,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721033275] [2022-07-20 05:47:25,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:25,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:47:25,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:25,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:47:25,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:47:25,147 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-20 05:47:25,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:25,439 INFO L93 Difference]: Finished difference Result 398 states and 537 transitions. [2022-07-20 05:47:25,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 05:47:25,440 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-20 05:47:25,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:25,442 INFO L225 Difference]: With dead ends: 398 [2022-07-20 05:47:25,442 INFO L226 Difference]: Without dead ends: 398 [2022-07-20 05:47:25,442 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-20 05:47:25,443 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-20 05:47:25,443 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-20 05:47:25,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-07-20 05:47:25,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 386. [2022-07-20 05:47:25,453 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-20 05:47:25,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 524 transitions. [2022-07-20 05:47:25,459 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 524 transitions. Word has length 20 [2022-07-20 05:47:25,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:25,459 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 524 transitions. [2022-07-20 05:47:25,459 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-20 05:47:25,459 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 524 transitions. [2022-07-20 05:47:25,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 05:47:25,460 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:25,460 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-20 05:47:25,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 05:47:25,460 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-20 05:47:25,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:25,461 INFO L85 PathProgramCache]: Analyzing trace with hash 248818477, now seen corresponding path program 1 times [2022-07-20 05:47:25,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:25,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434200600] [2022-07-20 05:47:25,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:25,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:25,599 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-20 05:47:25,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:25,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434200600] [2022-07-20 05:47:25,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434200600] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:25,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:25,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 05:47:25,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508649084] [2022-07-20 05:47:25,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:25,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 05:47:25,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:25,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 05:47:25,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:47:25,601 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-20 05:47:26,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:26,226 INFO L93 Difference]: Finished difference Result 526 states and 579 transitions. [2022-07-20 05:47:26,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 05:47:26,227 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-20 05:47:26,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:26,229 INFO L225 Difference]: With dead ends: 526 [2022-07-20 05:47:26,229 INFO L226 Difference]: Without dead ends: 526 [2022-07-20 05:47:26,230 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-20 05:47:26,230 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.6s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:26,231 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.6s Time] [2022-07-20 05:47:26,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-07-20 05:47:26,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 389. [2022-07-20 05:47:26,242 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-20 05:47:26,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 527 transitions. [2022-07-20 05:47:26,244 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 527 transitions. Word has length 22 [2022-07-20 05:47:26,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:26,244 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 527 transitions. [2022-07-20 05:47:26,244 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-20 05:47:26,244 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 527 transitions. [2022-07-20 05:47:26,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 05:47:26,245 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:26,245 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-20 05:47:26,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 05:47:26,246 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-20 05:47:26,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:26,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1532217100, now seen corresponding path program 1 times [2022-07-20 05:47:26,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:26,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079450107] [2022-07-20 05:47:26,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:26,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:26,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 05:47:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:26,736 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-20 05:47:26,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:26,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079450107] [2022-07-20 05:47:26,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079450107] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:47:26,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671869266] [2022-07-20 05:47:26,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:26,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:26,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:47:26,739 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-20 05:47:26,770 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-20 05:47:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:26,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-20 05:47:26,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:26,984 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-20 05:47:27,328 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-20 05:47:27,334 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-20 05:47:27,437 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:47:27,438 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-20 05:47:27,456 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:47:27,457 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-20 05:47:27,478 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-20 05:47:27,489 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-20 05:47:27,602 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:47:27,603 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-20 05:47:27,626 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:47:27,626 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-20 05:47:27,837 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:27,844 INFO L356 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-07-20 05:47:27,845 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-20 05:47:28,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:47:28,032 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-20 05:47:28,046 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-07-20 05:47:28,047 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-20 05:47:28,115 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-20 05:47:28,121 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-20 05:47:28,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, 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-20 05:47:28,245 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-20 05:47:28,292 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-20 05:47:28,298 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-20 05:47:28,369 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:28,370 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-20 05:47:28,375 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:28,376 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-20 05:47:28,408 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-20 05:47:28,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:47:28,525 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-20 05:47:30,977 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:30,978 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-20 05:47:30,985 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:30,985 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-20 05:47:30,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:30,998 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:30,998 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-20 05:47:31,003 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:31,010 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:31,011 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-20 05:47:31,017 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-20 05:47:31,022 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-20 05:47:31,082 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-20 05:47:31,083 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-20 05:47:31,088 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-20 05:47:31,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671869266] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:47:31,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:47:31,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2022-07-20 05:47:31,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741005539] [2022-07-20 05:47:31,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:47:31,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-20 05:47:31,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:31,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-20 05:47:31,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=896, Unknown=4, NotChecked=60, Total=1056 [2022-07-20 05:47:31,200 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-20 05:47:33,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:33,833 INFO L93 Difference]: Finished difference Result 454 states and 616 transitions. [2022-07-20 05:47:33,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 05:47:33,837 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-20 05:47:33,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:33,841 INFO L225 Difference]: With dead ends: 454 [2022-07-20 05:47:33,841 INFO L226 Difference]: Without dead ends: 454 [2022-07-20 05:47:33,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=273, Invalid=1889, Unknown=4, NotChecked=90, Total=2256 [2022-07-20 05:47:33,844 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 127 mSDsluCounter, 3805 mSDsCounter, 0 mSdLazyCounter, 2656 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:33,845 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.4s Time] [2022-07-20 05:47:33,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-07-20 05:47:33,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 445. [2022-07-20 05:47:33,865 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-20 05:47:33,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 611 transitions. [2022-07-20 05:47:33,867 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 611 transitions. Word has length 37 [2022-07-20 05:47:33,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:33,867 INFO L495 AbstractCegarLoop]: Abstraction has 445 states and 611 transitions. [2022-07-20 05:47:33,868 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-20 05:47:33,868 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 611 transitions. [2022-07-20 05:47:33,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 05:47:33,869 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:33,869 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-20 05:47:33,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-20 05:47:34,078 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-20 05:47:34,079 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-20 05:47:34,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:34,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1532217101, now seen corresponding path program 1 times [2022-07-20 05:47:34,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:34,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282587781] [2022-07-20 05:47:34,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:34,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:34,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 05:47:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:34,440 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-20 05:47:34,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:34,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282587781] [2022-07-20 05:47:34,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282587781] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:47:34,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687829769] [2022-07-20 05:47:34,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:34,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:34,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:47:34,444 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-20 05:47:34,456 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-20 05:47:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:34,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-20 05:47:34,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:34,574 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-20 05:47:34,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-20 05:47:34,800 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:47:34,800 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-20 05:47:34,809 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-20 05:47:34,877 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:47:34,877 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-20 05:47:34,966 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:34,971 INFO L356 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-07-20 05:47:34,971 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-20 05:47:35,130 INFO L356 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2022-07-20 05:47:35,131 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-20 05:47:35,181 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-20 05:47:35,281 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-20 05:47:35,313 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-20 05:47:35,359 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:35,359 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-20 05:47:35,389 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-20 05:47:35,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:47:35,410 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_518 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_518) c_append_~head.base) (+ c_append_~head.offset 4))) 1)) is different from false [2022-07-20 05:47:35,586 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:35,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-20 05:47:35,596 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:35,596 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-20 05:47:35,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 44 treesize of output 40 [2022-07-20 05:47:35,606 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 74 [2022-07-20 05:47:36,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687829769] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:47:36,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:47:36,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 27 [2022-07-20 05:47:36,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747070599] [2022-07-20 05:47:36,067 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:47:36,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-20 05:47:36,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:36,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-20 05:47:36,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=889, Unknown=3, NotChecked=60, Total=1056 [2022-07-20 05:47:36,068 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-20 05:47:37,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:37,109 INFO L93 Difference]: Finished difference Result 482 states and 647 transitions. [2022-07-20 05:47:37,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-20 05:47:37,109 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-20 05:47:37,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:37,112 INFO L225 Difference]: With dead ends: 482 [2022-07-20 05:47:37,112 INFO L226 Difference]: Without dead ends: 482 [2022-07-20 05:47:37,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=170, Invalid=1313, Unknown=3, NotChecked=74, Total=1560 [2022-07-20 05:47:37,113 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 81 mSDsluCounter, 3714 mSDsCounter, 0 mSdLazyCounter, 1719 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.8s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:37,113 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.8s Time] [2022-07-20 05:47:37,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-07-20 05:47:37,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 476. [2022-07-20 05:47:37,124 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-20 05:47:37,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 643 transitions. [2022-07-20 05:47:37,126 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 643 transitions. Word has length 37 [2022-07-20 05:47:37,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:37,127 INFO L495 AbstractCegarLoop]: Abstraction has 476 states and 643 transitions. [2022-07-20 05:47:37,127 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-20 05:47:37,127 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 643 transitions. [2022-07-20 05:47:37,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 05:47:37,128 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:37,128 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-20 05:47:37,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-20 05:47:37,352 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-20 05:47:37,353 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-20 05:47:37,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:37,353 INFO L85 PathProgramCache]: Analyzing trace with hash -568836631, now seen corresponding path program 1 times [2022-07-20 05:47:37,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:37,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733353580] [2022-07-20 05:47:37,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:37,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:37,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 05:47:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:37,879 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-20 05:47:37,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:37,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733353580] [2022-07-20 05:47:37,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733353580] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:47:37,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150284209] [2022-07-20 05:47:37,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:37,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:37,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:47:37,884 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-20 05:47:37,885 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-20 05:47:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:37,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-20 05:47:38,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:38,009 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-20 05:47:38,200 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-20 05:47:38,204 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-20 05:47:38,266 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:47:38,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, 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-20 05:47:38,279 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:47:38,279 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-20 05:47:38,287 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-20 05:47:38,297 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-20 05:47:38,395 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:47:38,395 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-20 05:47:38,410 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:47:38,410 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-20 05:47:38,590 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:38,598 INFO L356 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-07-20 05:47:38,598 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-20 05:47:38,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:47:38,767 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-20 05:47:38,792 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-07-20 05:47:38,793 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-20 05:47:38,855 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-20 05:47:38,859 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-20 05:47:38,968 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-20 05:47:38,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, 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-20 05:47:39,008 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-20 05:47:39,013 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-20 05:47:39,065 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:39,066 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-20 05:47:39,070 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:39,071 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-20 05:47:39,102 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-20 05:47:39,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:47:39,177 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-20 05:47:39,555 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:39,555 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-20 05:47:39,561 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:39,561 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-20 05:47:39,564 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:39,577 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:39,577 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-20 05:47:39,581 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:39,587 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47: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, 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-20 05:47:39,592 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-20 05:47:39,596 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-20 05:47:39,639 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-20 05:47:39,640 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-20 05:47:39,645 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-20 05:47:39,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150284209] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:47:39,738 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:47:39,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2022-07-20 05:47:39,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347222242] [2022-07-20 05:47:39,738 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:47:39,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-20 05:47:39,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:39,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-20 05:47:39,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=898, Unknown=3, NotChecked=60, Total=1056 [2022-07-20 05:47:39,740 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-20 05:47:41,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:41,363 INFO L93 Difference]: Finished difference Result 515 states and 692 transitions. [2022-07-20 05:47:41,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 05:47:41,363 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-20 05:47:41,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:41,366 INFO L225 Difference]: With dead ends: 515 [2022-07-20 05:47:41,366 INFO L226 Difference]: Without dead ends: 515 [2022-07-20 05:47:41,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=190, Invalid=1617, Unknown=3, NotChecked=82, Total=1892 [2022-07-20 05:47:41,367 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, 1.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:41,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3629 Invalid, 2858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2108 Invalid, 0 Unknown, 716 Unchecked, 1.0s Time] [2022-07-20 05:47:41,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-07-20 05:47:41,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 493. [2022-07-20 05:47:41,377 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-20 05:47:41,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 667 transitions. [2022-07-20 05:47:41,380 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 667 transitions. Word has length 39 [2022-07-20 05:47:41,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:41,381 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 667 transitions. [2022-07-20 05:47:41,381 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-20 05:47:41,381 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 667 transitions. [2022-07-20 05:47:41,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 05:47:41,382 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:41,382 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-20 05:47:41,410 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-20 05:47:41,601 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-20 05:47:41,602 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-20 05:47:41,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:41,602 INFO L85 PathProgramCache]: Analyzing trace with hash -568836632, now seen corresponding path program 1 times [2022-07-20 05:47:41,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:41,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205847249] [2022-07-20 05:47:41,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:41,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:41,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 05:47:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:41,959 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-20 05:47:41,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:41,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205847249] [2022-07-20 05:47:41,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205847249] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:47:41,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288448031] [2022-07-20 05:47:41,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:41,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:41,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:47:41,961 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-20 05:47:41,962 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-20 05:47:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:42,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-20 05:47:42,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:42,088 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-20 05:47:42,242 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-20 05:47:42,276 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:47:42,276 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-20 05:47:42,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 7 treesize of output 3 [2022-07-20 05:47:42,322 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:47:42,322 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-20 05:47:42,377 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:42,383 INFO L356 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-07-20 05:47:42,384 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-20 05:47:42,481 INFO L356 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2022-07-20 05:47:42,482 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-20 05:47:42,527 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-20 05:47:42,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, 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-20 05:47:42,690 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-20 05:47:42,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:42,735 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-20 05:47:42,762 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-20 05:47:42,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:47:43,044 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:43,045 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-20 05:47:43,053 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:43,054 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-20 05:47:43,061 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-20 05:47:43,067 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-20 05:47:43,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288448031] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:47:43,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:47:43,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2022-07-20 05:47:43,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486956866] [2022-07-20 05:47:43,506 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:47:43,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-20 05:47:43,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:43,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-20 05:47:43,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1057, Unknown=13, NotChecked=0, Total=1190 [2022-07-20 05:47:43,508 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-20 05:47:44,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:44,764 INFO L93 Difference]: Finished difference Result 658 states and 746 transitions. [2022-07-20 05:47:44,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 05:47:44,765 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-20 05:47:44,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:44,768 INFO L225 Difference]: With dead ends: 658 [2022-07-20 05:47:44,768 INFO L226 Difference]: Without dead ends: 658 [2022-07-20 05:47:44,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=272, Invalid=1695, Unknown=13, NotChecked=0, Total=1980 [2022-07-20 05:47:44,769 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 1109 mSDsluCounter, 2043 mSDsCounter, 0 mSdLazyCounter, 1806 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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-20 05:47:44,769 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-20 05:47:44,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2022-07-20 05:47:44,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 491. [2022-07-20 05:47:44,778 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-20 05:47:44,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 659 transitions. [2022-07-20 05:47:44,781 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 659 transitions. Word has length 39 [2022-07-20 05:47:44,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:44,781 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 659 transitions. [2022-07-20 05:47:44,782 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-20 05:47:44,782 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 659 transitions. [2022-07-20 05:47:44,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 05:47:44,783 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:44,783 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-20 05:47:44,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-20 05:47:44,991 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-20 05:47:44,991 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-20 05:47:44,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:44,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1220540201, now seen corresponding path program 1 times [2022-07-20 05:47:44,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:44,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458472640] [2022-07-20 05:47:44,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:44,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:45,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 05:47:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:45,257 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-20 05:47:45,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:45,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458472640] [2022-07-20 05:47:45,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458472640] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:47:45,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113292413] [2022-07-20 05:47:45,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:45,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:45,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:47:45,259 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-20 05:47:45,285 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-20 05:47:45,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:45,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-20 05:47:45,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:45,415 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-20 05:47:45,553 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-20 05:47:45,590 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-20 05:47:45,591 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-20 05:47:45,628 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:47:45,629 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-20 05:47:45,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:47:45,643 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-20 05:47:45,691 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:47:45,691 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-20 05:47:45,752 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-20 05:47:45,753 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-20 05:47:45,829 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:47:45,829 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-20 05:47:45,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 34 treesize of output 30 [2022-07-20 05:47:45,894 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:45,894 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-20 05:47:45,899 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-20 05:47:45,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:47:45,909 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-20 05:47:45,915 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-20 05:47:45,926 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-20 05:47:46,018 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-20 05:47:46,019 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-20 05:47:46,021 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:46,025 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-20 05:47:46,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 72 treesize of output 34 [2022-07-20 05:47:46,029 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-20 05:47:46,035 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:47:46,036 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-20 05:47:46,181 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-20 05:47:46,181 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-20 05:47:46,201 INFO L356 Elim1Store]: treesize reduction 10, result has 71.4 percent of original size [2022-07-20 05:47:46,201 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-20 05:47:46,207 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-20 05:47:46,212 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-20 05:47:46,488 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:46,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 61 treesize of output 169 [2022-07-20 05:47:47,405 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-20 05:47:47,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113292413] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:47:47,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:47:47,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 15] total 37 [2022-07-20 05:47:47,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473550363] [2022-07-20 05:47:47,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:47:47,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-20 05:47:47,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:47,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-20 05:47:47,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=965, Unknown=6, NotChecked=198, Total=1332 [2022-07-20 05:47:47,408 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-20 05:47:49,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:49,233 INFO L93 Difference]: Finished difference Result 616 states and 670 transitions. [2022-07-20 05:47:49,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 05:47:49,233 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-20 05:47:49,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:49,236 INFO L225 Difference]: With dead ends: 616 [2022-07-20 05:47:49,236 INFO L226 Difference]: Without dead ends: 616 [2022-07-20 05:47:49,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=408, Invalid=1945, Unknown=11, NotChecked=288, Total=2652 [2022-07-20 05:47:49,237 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 628 mSDsluCounter, 2536 mSDsCounter, 0 mSdLazyCounter, 2525 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 2724 SdHoareTripleChecker+Invalid, 4068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 2525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1410 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:49,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 2724 Invalid, 4068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 2525 Invalid, 0 Unknown, 1410 Unchecked, 1.2s Time] [2022-07-20 05:47:49,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2022-07-20 05:47:49,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 464. [2022-07-20 05:47:49,244 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-20 05:47:49,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 603 transitions. [2022-07-20 05:47:49,245 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 603 transitions. Word has length 39 [2022-07-20 05:47:49,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:49,246 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 603 transitions. [2022-07-20 05:47:49,246 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-20 05:47:49,246 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 603 transitions. [2022-07-20 05:47:49,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-20 05:47:49,249 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:49,249 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-20 05:47:49,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-20 05:47:49,463 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-20 05:47:49,463 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-20 05:47:49,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:49,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1913380289, now seen corresponding path program 1 times [2022-07-20 05:47:49,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:49,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103547543] [2022-07-20 05:47:49,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:49,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:49,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 05:47:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:49,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-20 05:47:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:49,755 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-20 05:47:49,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:49,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103547543] [2022-07-20 05:47:49,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103547543] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:47:49,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701278055] [2022-07-20 05:47:49,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:49,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:49,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:47:49,757 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-20 05:47:49,780 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-20 05:47:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:49,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-20 05:47:49,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:49,972 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-20 05:47:50,163 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-20 05:47:50,175 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-20 05:47:50,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:47:50,294 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-20 05:47:50,309 INFO L356 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2022-07-20 05:47:50,310 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-20 05:47:50,359 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-20 05:47:50,364 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-20 05:47:50,454 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-20 05:47:50,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, 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-20 05:47:50,485 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-20 05:47:50,489 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-20 05:47:50,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:50,529 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-20 05:47:50,532 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:50,534 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:50,534 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-20 05:47:50,568 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-20 05:47:50,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:47:50,624 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-20 05:47:50,905 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:50,905 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-20 05:47:50,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:50,915 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-07-20 05:47:50,915 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-20 05:47:50,923 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-20 05:47:50,923 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-20 05:47:51,090 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:51,091 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-20 05:47:51,098 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:51,098 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-20 05:47:51,102 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-20 05:47:51,118 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:51,118 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-20 05:47:51,124 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:51,124 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-20 05:47:51,126 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:51,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:47:51,129 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-20 05:47:51,131 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:51,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:47:51,136 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-20 05:47:51,366 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 105 treesize of output 101 [2022-07-20 05:47:51,782 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-20 05:47:51,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701278055] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:47:51,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:47:51,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-07-20 05:47:51,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65584876] [2022-07-20 05:47:51,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:47:51,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-20 05:47:51,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:51,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-20 05:47:51,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=777, Unknown=3, NotChecked=56, Total=930 [2022-07-20 05:47:51,784 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-20 05:47:52,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:52,841 INFO L93 Difference]: Finished difference Result 496 states and 633 transitions. [2022-07-20 05:47:52,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 05:47:52,841 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-20 05:47:52,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:52,843 INFO L225 Difference]: With dead ends: 496 [2022-07-20 05:47:52,843 INFO L226 Difference]: Without dead ends: 496 [2022-07-20 05:47:52,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=257, Invalid=1724, Unknown=3, NotChecked=86, Total=2070 [2022-07-20 05:47:52,844 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 96 mSDsluCounter, 2274 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:52,844 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.5s Time] [2022-07-20 05:47:52,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-07-20 05:47:52,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 462. [2022-07-20 05:47:52,851 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-20 05:47:52,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 599 transitions. [2022-07-20 05:47:52,853 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 599 transitions. Word has length 54 [2022-07-20 05:47:52,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:52,854 INFO L495 AbstractCegarLoop]: Abstraction has 462 states and 599 transitions. [2022-07-20 05:47:52,854 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-20 05:47:52,854 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 599 transitions. [2022-07-20 05:47:52,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-20 05:47:52,855 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:52,855 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-20 05:47:52,882 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-20 05:47:53,079 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-20 05:47:53,079 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-20 05:47:53,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:53,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1392743212, now seen corresponding path program 1 times [2022-07-20 05:47:53,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:53,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740031460] [2022-07-20 05:47:53,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:53,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:53,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 05:47:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:53,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-20 05:47:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:53,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-20 05:47:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:53,480 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-20 05:47:53,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:53,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740031460] [2022-07-20 05:47:53,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740031460] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:47:53,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227811331] [2022-07-20 05:47:53,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:53,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:53,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:47:53,483 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-20 05:47:53,484 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-20 05:47:53,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:53,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-20 05:47:53,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:53,738 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-20 05:47:53,875 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-20 05:47:53,879 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-20 05:47:53,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:47:53,970 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-20 05:47:53,982 INFO L356 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2022-07-20 05:47:53,982 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-20 05:47:54,015 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-20 05:47:54,018 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-20 05:47:54,129 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-20 05:47:54,132 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-20 05:47:54,160 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-20 05:47:54,164 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-20 05:47:54,195 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:54,196 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-20 05:47:54,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:54,200 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:54,200 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-20 05:47:54,217 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-20 05:47:54,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:47:54,259 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-20 05:47:54,592 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:54,593 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-20 05:47:54,599 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:54,599 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-20 05:47:54,601 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:54,609 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-07-20 05:47:54,609 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-20 05:47:54,612 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:54,613 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:54,614 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-20 05:47:54,621 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-20 05:47:54,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 24 treesize of output 1 [2022-07-20 05:47:54,811 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:54,811 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-20 05:47:54,817 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:54,817 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-20 05:47:54,821 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-20 05:47:54,836 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:54,837 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-20 05:47:54,843 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:54,843 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-20 05:47:54,845 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:54,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:47:54,848 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-20 05:47:54,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:54,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:47:54,852 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-20 05:47:59,195 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 105 treesize of output 101 [2022-07-20 05:47:59,673 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-20 05:47:59,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227811331] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:47:59,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:47:59,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2022-07-20 05:47:59,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072918110] [2022-07-20 05:47:59,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:47:59,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-20 05:47:59,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:59,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-20 05:47:59,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=938, Unknown=1, NotChecked=62, Total=1122 [2022-07-20 05:47:59,676 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-20 05:48:01,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:48:01,273 INFO L93 Difference]: Finished difference Result 617 states and 669 transitions. [2022-07-20 05:48:01,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 05:48:01,274 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-20 05:48:01,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:48:01,276 INFO L225 Difference]: With dead ends: 617 [2022-07-20 05:48:01,276 INFO L226 Difference]: Without dead ends: 617 [2022-07-20 05:48:01,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=288, Invalid=1521, Unknown=1, NotChecked=82, Total=1892 [2022-07-20 05:48:01,277 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 587 mSDsluCounter, 2339 mSDsCounter, 0 mSdLazyCounter, 2552 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:48:01,277 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.2s Time] [2022-07-20 05:48:01,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2022-07-20 05:48:01,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 478. [2022-07-20 05:48:01,285 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-20 05:48:01,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 614 transitions. [2022-07-20 05:48:01,287 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 614 transitions. Word has length 71 [2022-07-20 05:48:01,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:48:01,287 INFO L495 AbstractCegarLoop]: Abstraction has 478 states and 614 transitions. [2022-07-20 05:48:01,287 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-20 05:48:01,287 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 614 transitions. [2022-07-20 05:48:01,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-20 05:48:01,288 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:48:01,288 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-20 05:48:01,308 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-20 05:48:01,499 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-20 05:48:01,500 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-20 05:48:01,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:48:01,500 INFO L85 PathProgramCache]: Analyzing trace with hash 358204681, now seen corresponding path program 1 times [2022-07-20 05:48:01,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:48:01,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738878812] [2022-07-20 05:48:01,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:01,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:48:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:01,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 05:48:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:01,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 05:48:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:01,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-20 05:48:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:01,841 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-20 05:48:01,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:48:01,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738878812] [2022-07-20 05:48:01,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738878812] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:48:01,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776082825] [2022-07-20 05:48:01,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:01,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:48:01,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:48:01,844 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-20 05:48:01,869 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-20 05:48:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:02,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-20 05:48:02,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:48:02,111 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-20 05:48:02,245 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-20 05:48:02,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:48:02,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:48:02,375 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-20 05:48:02,387 INFO L356 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2022-07-20 05:48:02,387 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-20 05:48:02,426 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-20 05:48:02,428 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-20 05:48:02,515 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-20 05:48:02,518 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-20 05:48:02,543 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-20 05:48:02,546 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-20 05:48:02,590 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:48:02,591 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-20 05:48:02,594 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:48:02,596 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:02,596 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-20 05:48:02,621 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-20 05:48:02,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:48:02,671 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-20 05:48:03,281 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:03,281 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-20 05:48:03,290 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:03,290 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-20 05:48:03,292 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:48:03,299 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-07-20 05:48:03,299 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-20 05:48:03,301 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:48:03,303 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:48:03,303 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-20 05:48:03,310 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-20 05:48:03,310 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-20 05:48:03,469 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:03,470 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-20 05:48:03,478 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:03,478 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-20 05:48:03,482 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-20 05:48:03,499 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:03,500 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-20 05:48:03,505 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:03,505 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-20 05:48:03,507 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:48:03,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:48:03,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, 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-20 05:48:03,513 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:48:03,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:48:03,516 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-20 05:48:07,843 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 105 treesize of output 101 [2022-07-20 05:48:08,294 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-20 05:48:08,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776082825] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:48:08,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:48:08,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 32 [2022-07-20 05:48:08,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381050880] [2022-07-20 05:48:08,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:48:08,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-20 05:48:08,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:48:08,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-20 05:48:08,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=893, Unknown=2, NotChecked=60, Total=1056 [2022-07-20 05:48:08,297 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-20 05:48:09,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:48:09,710 INFO L93 Difference]: Finished difference Result 511 states and 646 transitions. [2022-07-20 05:48:09,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-20 05:48:09,710 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-20 05:48:09,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:48:09,712 INFO L225 Difference]: With dead ends: 511 [2022-07-20 05:48:09,712 INFO L226 Difference]: Without dead ends: 511 [2022-07-20 05:48:09,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 145 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=316, Invalid=1666, Unknown=2, NotChecked=86, Total=2070 [2022-07-20 05:48:09,714 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 122 mSDsluCounter, 2572 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-07-20 05:48:09,714 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.7s Time] [2022-07-20 05:48:09,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2022-07-20 05:48:09,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 452. [2022-07-20 05:48:09,727 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-20 05:48:09,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 583 transitions. [2022-07-20 05:48:09,729 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 583 transitions. Word has length 81 [2022-07-20 05:48:09,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:48:09,729 INFO L495 AbstractCegarLoop]: Abstraction has 452 states and 583 transitions. [2022-07-20 05:48:09,729 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-20 05:48:09,729 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 583 transitions. [2022-07-20 05:48:09,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-20 05:48:09,730 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:48:09,730 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-20 05:48:09,760 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-20 05:48:09,951 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-20 05:48:09,951 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-20 05:48:09,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:48:09,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1693525601, now seen corresponding path program 1 times [2022-07-20 05:48:09,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:48:09,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897075908] [2022-07-20 05:48:09,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:09,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:48:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:10,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 05:48:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:10,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-20 05:48:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:10,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-20 05:48:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:10,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-20 05:48:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:10,429 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-20 05:48:10,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:48:10,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897075908] [2022-07-20 05:48:10,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897075908] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:48:10,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253764643] [2022-07-20 05:48:10,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:10,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:48:10,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:48:10,432 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-20 05:48:10,459 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-20 05:48:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:10,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-20 05:48:10,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:48:10,760 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-20 05:48:10,894 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-20 05:48:10,900 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-20 05:48:10,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:48:10,990 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-20 05:48:11,000 INFO L356 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2022-07-20 05:48:11,001 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-20 05:48:11,034 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-20 05:48:11,037 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-20 05:48:11,146 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-20 05:48:11,149 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-20 05:48:11,191 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-20 05:48:11,195 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-20 05:48:11,239 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:48:11,239 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-20 05:48:11,242 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:48:11,244 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:11,244 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-20 05:48:11,272 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-20 05:48:11,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:48:11,326 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-20 05:48:11,634 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:11,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 24 treesize of output 25 [2022-07-20 05:48:11,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:48:11,642 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-07-20 05:48:11,642 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-20 05:48:11,649 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-20 05:48:11,649 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-20 05:48:11,800 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:11,800 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-20 05:48:11,804 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:11,804 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-20 05:48:11,812 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:11,812 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-20 05:48:11,821 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:11,821 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-20 05:48:11,825 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-20 05:48:11,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 42 treesize of output 34 [2022-07-20 05:48:11,886 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:11,887 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-20 05:48:11,889 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:48:11,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:48:11,892 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-20 05:48:12,135 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 105 treesize of output 101 [2022-07-20 05:48:12,548 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-20 05:48:12,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253764643] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:48:12,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:48:12,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2022-07-20 05:48:12,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355258370] [2022-07-20 05:48:12,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:48:12,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-20 05:48:12,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:48:12,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-20 05:48:12,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=942, Unknown=1, NotChecked=62, Total=1122 [2022-07-20 05:48:12,551 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-20 05:48:13,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:48:13,363 INFO L93 Difference]: Finished difference Result 465 states and 596 transitions. [2022-07-20 05:48:13,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 05:48:13,363 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-20 05:48:13,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:48:13,365 INFO L225 Difference]: With dead ends: 465 [2022-07-20 05:48:13,365 INFO L226 Difference]: Without dead ends: 465 [2022-07-20 05:48:13,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 167 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=242, Invalid=1483, Unknown=1, NotChecked=80, Total=1806 [2022-07-20 05:48:13,367 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 338 mSDsluCounter, 1950 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:48:13,367 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.5s Time] [2022-07-20 05:48:13,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2022-07-20 05:48:13,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 464. [2022-07-20 05:48:13,373 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-20 05:48:13,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 595 transitions. [2022-07-20 05:48:13,375 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 595 transitions. Word has length 88 [2022-07-20 05:48:13,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:48:13,375 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 595 transitions. [2022-07-20 05:48:13,375 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-20 05:48:13,376 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 595 transitions. [2022-07-20 05:48:13,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-20 05:48:13,376 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:48:13,377 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-20 05:48:13,407 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-20 05:48:13,590 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-20 05:48:13,590 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-20 05:48:13,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:48:13,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1694546100, now seen corresponding path program 1 times [2022-07-20 05:48:13,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:48:13,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862484464] [2022-07-20 05:48:13,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:13,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:48:13,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:13,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 05:48:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:13,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-20 05:48:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:13,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-20 05:48:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:13,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-20 05:48:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:13,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 05:48:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:14,014 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-20 05:48:14,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:48:14,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862484464] [2022-07-20 05:48:14,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862484464] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:48:14,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103799001] [2022-07-20 05:48:14,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:14,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:48:14,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:48:14,016 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-20 05:48:14,045 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-20 05:48:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:14,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 904 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-20 05:48:14,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:48:14,353 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-20 05:48:14,481 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-20 05:48:14,483 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-20 05:48:14,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:48:14,585 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-20 05:48:14,596 INFO L356 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2022-07-20 05:48:14,596 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-20 05:48:14,627 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-20 05:48:14,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, 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-20 05:48:14,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, 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-20 05:48:14,726 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-20 05:48:14,749 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-20 05:48:14,752 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-20 05:48:14,783 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:48:14,784 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-20 05:48:14,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:48:14,787 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:14,787 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-20 05:48:14,805 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-20 05:48:14,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:48:14,847 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-20 05:48:15,136 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:15,137 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-20 05:48:15,143 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:15,143 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-20 05:48:15,145 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:48:15,162 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-07-20 05:48:15,163 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-20 05:48:15,165 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:48:15,167 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:48:15,168 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-20 05:48:15,174 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-20 05:48:15,175 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-20 05:48:15,340 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:15,341 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-20 05:48:15,346 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:15,347 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-20 05:48:15,356 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:15,356 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-20 05:48:15,369 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:15,369 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-20 05:48:15,373 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-20 05:48:15,377 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-20 05:48:15,417 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:15,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 25 [2022-07-20 05:48:15,419 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:48:15,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:48:15,421 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-20 05:48:17,687 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 105 treesize of output 101 [2022-07-20 05:48:18,090 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-20 05:48:18,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103799001] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:48:18,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:48:18,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2022-07-20 05:48:18,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151812905] [2022-07-20 05:48:18,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:48:18,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-20 05:48:18,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:48:18,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-20 05:48:18,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=938, Unknown=1, NotChecked=62, Total=1122 [2022-07-20 05:48:18,091 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-20 05:48:19,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:48:19,785 INFO L93 Difference]: Finished difference Result 636 states and 684 transitions. [2022-07-20 05:48:19,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 05:48:19,785 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-20 05:48:19,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:48:19,787 INFO L225 Difference]: With dead ends: 636 [2022-07-20 05:48:19,787 INFO L226 Difference]: Without dead ends: 636 [2022-07-20 05:48:19,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=274, Invalid=1451, Unknown=1, NotChecked=80, Total=1806 [2022-07-20 05:48:19,788 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 820 mSDsluCounter, 2530 mSDsCounter, 0 mSdLazyCounter, 2858 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:48:19,788 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.3s Time] [2022-07-20 05:48:19,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2022-07-20 05:48:19,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 451. [2022-07-20 05:48:19,795 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-20 05:48:19,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 582 transitions. [2022-07-20 05:48:19,797 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 582 transitions. Word has length 105 [2022-07-20 05:48:19,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:48:19,797 INFO L495 AbstractCegarLoop]: Abstraction has 451 states and 582 transitions. [2022-07-20 05:48:19,797 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-20 05:48:19,797 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 582 transitions. [2022-07-20 05:48:19,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2022-07-20 05:48:19,800 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:48:19,800 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-20 05:48:19,825 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-20 05:48:20,015 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-20 05:48:20,015 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-20 05:48:20,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:48:20,016 INFO L85 PathProgramCache]: Analyzing trace with hash -365002613, now seen corresponding path program 1 times [2022-07-20 05:48:20,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:48:20,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106818577] [2022-07-20 05:48:20,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:20,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:48:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:23,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 05:48:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:23,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-20 05:48:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:23,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-20 05:48:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:23,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-20 05:48:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:24,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 05:48:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:24,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 05:48:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:24,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 05:48:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:24,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 05:48:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:25,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 05:48:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:25,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-20 05:48:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:26,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-20 05:48:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:26,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-20 05:48:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:26,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-20 05:48:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:27,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-07-20 05:48:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:27,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-20 05:48:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:28,313 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-20 05:48:28,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:48:28,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106818577] [2022-07-20 05:48:28,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106818577] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:48:28,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011285443] [2022-07-20 05:48:28,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:28,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:48:28,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:48:28,315 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-20 05:48:28,345 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-20 05:48:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:29,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 2276 conjuncts, 449 conjunts are in the unsatisfiable core [2022-07-20 05:48:29,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:48:29,106 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-20 05:48:29,321 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-20 05:48:29,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:48:29,363 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-20 05:48:29,417 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:48:29,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, 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-20 05:48:29,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:48:29,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-20 05:48:29,484 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:48:29,484 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-20 05:48:29,563 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-20 05:48:29,563 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-20 05:48:30,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:48:30,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:48:30,225 INFO L356 Elim1Store]: treesize reduction 58, result has 33.3 percent of original size [2022-07-20 05:48:30,226 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-20 05:48:30,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-20 05:48:30,431 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-20 05:48:30,432 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:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) 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:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) 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:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) 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-20 05:48:30,435 INFO L158 Benchmark]: Toolchain (without parser) took 69516.61ms. Allocated memory was 90.2MB in the beginning and 442.5MB in the end (delta: 352.3MB). Free memory was 66.7MB in the beginning and 280.7MB in the end (delta: -214.0MB). Peak memory consumption was 138.9MB. Max. memory is 16.1GB. [2022-07-20 05:48:30,435 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 90.2MB. Free memory is still 53.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:48:30,435 INFO L158 Benchmark]: CACSL2BoogieTranslator took 438.16ms. Allocated memory is still 90.2MB. Free memory was 66.5MB in the beginning and 57.0MB in the end (delta: 9.4MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2022-07-20 05:48:30,435 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.20ms. Allocated memory is still 90.2MB. Free memory was 56.9MB in the beginning and 54.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-20 05:48:30,435 INFO L158 Benchmark]: Boogie Preprocessor took 40.96ms. Allocated memory is still 90.2MB. Free memory was 54.0MB in the beginning and 51.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 05:48:30,435 INFO L158 Benchmark]: RCFGBuilder took 775.12ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 51.2MB in the beginning and 61.7MB in the end (delta: -10.5MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2022-07-20 05:48:30,436 INFO L158 Benchmark]: TraceAbstraction took 68188.45ms. Allocated memory was 109.1MB in the beginning and 442.5MB in the end (delta: 333.4MB). Free memory was 61.2MB in the beginning and 280.7MB in the end (delta: -219.5MB). Peak memory consumption was 114.4MB. Max. memory is 16.1GB. [2022-07-20 05:48:30,437 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.18ms. Allocated memory is still 90.2MB. Free memory is still 53.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 438.16ms. Allocated memory is still 90.2MB. Free memory was 66.5MB in the beginning and 57.0MB in the end (delta: 9.4MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.20ms. Allocated memory is still 90.2MB. Free memory was 56.9MB in the beginning and 54.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.96ms. Allocated memory is still 90.2MB. Free memory was 54.0MB in the beginning and 51.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 775.12ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 51.2MB in the beginning and 61.7MB in the end (delta: -10.5MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * TraceAbstraction took 68188.45ms. Allocated memory was 109.1MB in the beginning and 442.5MB in the end (delta: 333.4MB). Free memory was 61.2MB in the beginning and 280.7MB in the end (delta: -219.5MB). Peak memory consumption was 114.4MB. 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-20 05:48:30,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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-?-eb692b5 [2022-07-20 05:48:32,312 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:48:32,314 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:48:32,355 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:48:32,355 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:48:32,357 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:48:32,360 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:48:32,364 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:48:32,366 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:48:32,372 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:48:32,373 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:48:32,375 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:48:32,375 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:48:32,377 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:48:32,378 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:48:32,384 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:48:32,385 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:48:32,386 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:48:32,388 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:48:32,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:48:32,394 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:48:32,396 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:48:32,397 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:48:32,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:48:32,399 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:48:32,402 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:48:32,403 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:48:32,403 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:48:32,404 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:48:32,404 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:48:32,405 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:48:32,405 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:48:32,407 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:48:32,407 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:48:32,408 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:48:32,409 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:48:32,409 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:48:32,410 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:48:32,410 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:48:32,410 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:48:32,411 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:48:32,412 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:48:32,416 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-20 05:48:32,448 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:48:32,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:48:32,449 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:48:32,449 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:48:32,450 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:48:32,450 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:48:32,450 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:48:32,451 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:48:32,451 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:48:32,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:48:32,452 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:48:32,452 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:48:32,452 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:48:32,452 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:48:32,452 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:48:32,453 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:48:32,453 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:48:32,453 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 05:48:32,453 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:48:32,453 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:48:32,453 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 05:48:32,454 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 05:48:32,454 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:48:32,454 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:48:32,454 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:48:32,454 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:48:32,454 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:48:32,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:48:32,455 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:48:32,455 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:48:32,455 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 05:48:32,455 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 05:48:32,456 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 05:48:32,456 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-20 05:48:32,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:48:32,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:48:32,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:48:32,789 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:48:32,790 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:48:32,791 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-20 05:48:32,857 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92d45edde/ee58620f0ecc488883fe30798397641f/FLAGc9677c9c2 [2022-07-20 05:48:33,314 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:48:33,315 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i [2022-07-20 05:48:33,330 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92d45edde/ee58620f0ecc488883fe30798397641f/FLAGc9677c9c2 [2022-07-20 05:48:33,341 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92d45edde/ee58620f0ecc488883fe30798397641f [2022-07-20 05:48:33,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:48:33,344 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:48:33,345 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:48:33,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:48:33,348 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:48:33,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:48:33" (1/1) ... [2022-07-20 05:48:33,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a4f9223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:48:33, skipping insertion in model container [2022-07-20 05:48:33,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:48:33" (1/1) ... [2022-07-20 05:48:33,355 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:48:33,406 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:48:33,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:48:33,733 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 05:48:33,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:48:33,830 INFO L208 MainTranslator]: Completed translation [2022-07-20 05:48:33,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:48:33 WrapperNode [2022-07-20 05:48:33,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:48:33,832 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 05:48:33,833 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 05:48:33,833 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 05:48:33,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:48:33" (1/1) ... [2022-07-20 05:48:33,873 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:48:33" (1/1) ... [2022-07-20 05:48:33,917 INFO L137 Inliner]: procedures = 126, calls = 95, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 292 [2022-07-20 05:48:33,918 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 05:48:33,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 05:48:33,918 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 05:48:33,918 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 05:48:33,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:48:33" (1/1) ... [2022-07-20 05:48:33,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:48:33" (1/1) ... [2022-07-20 05:48:33,945 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:48:33" (1/1) ... [2022-07-20 05:48:33,947 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:48:33" (1/1) ... [2022-07-20 05:48:33,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:48:33" (1/1) ... [2022-07-20 05:48:33,980 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:48:33" (1/1) ... [2022-07-20 05:48:33,984 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:48:33" (1/1) ... [2022-07-20 05:48:33,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 05:48:33,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 05:48:33,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 05:48:33,995 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 05:48:33,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:48:33" (1/1) ... [2022-07-20 05:48:34,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:48:34,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:48:34,048 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-20 05:48:34,071 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-20 05:48:34,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-20 05:48:34,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 05:48:34,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 05:48:34,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 05:48:34,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 05:48:34,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-20 05:48:34,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 05:48:34,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-20 05:48:34,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 05:48:34,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 05:48:34,092 INFO L130 BoogieDeclarations]: Found specification of procedure append [2022-07-20 05:48:34,093 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2022-07-20 05:48:34,223 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 05:48:34,224 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 05:48:35,168 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 05:48:35,183 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 05:48:35,184 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-07-20 05:48:35,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:48:35 BoogieIcfgContainer [2022-07-20 05:48:35,187 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 05:48:35,189 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 05:48:35,189 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 05:48:35,191 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 05:48:35,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:48:33" (1/3) ... [2022-07-20 05:48:35,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de55644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:48:35, skipping insertion in model container [2022-07-20 05:48:35,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:48:33" (2/3) ... [2022-07-20 05:48:35,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de55644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:48:35, skipping insertion in model container [2022-07-20 05:48:35,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:48:35" (3/3) ... [2022-07-20 05:48:35,194 INFO L111 eAbstractionObserver]: Analyzing ICFG split_list_test05-2.i [2022-07-20 05:48:35,207 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 05:48:35,208 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 147 error locations. [2022-07-20 05:48:35,269 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 05:48:35,282 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@72bde6e7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@59fce17e [2022-07-20 05:48:35,282 INFO L358 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2022-07-20 05:48:35,297 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-20 05:48:35,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 05:48:35,303 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:48:35,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 05:48:35,304 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-20 05:48:35,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:48:35,310 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-20 05:48:35,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:48:35,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008013542] [2022-07-20 05:48:35,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:35,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:48:35,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:48:35,326 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-20 05:48:35,327 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-20 05:48:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:35,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 05:48:35,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:48:35,457 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-20 05:48:35,466 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-20 05:48:35,467 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:48:35,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:48:35,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008013542] [2022-07-20 05:48:35,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2008013542] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:48:35,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:48:35,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:48:35,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814632263] [2022-07-20 05:48:35,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:48:35,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:48:35,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:48:35,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:48:35,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:48:35,504 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-20 05:48:36,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:48:36,199 INFO L93 Difference]: Finished difference Result 545 states and 598 transitions. [2022-07-20 05:48:36,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:48:36,202 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-20 05:48:36,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:48:36,217 INFO L225 Difference]: With dead ends: 545 [2022-07-20 05:48:36,217 INFO L226 Difference]: Without dead ends: 543 [2022-07-20 05:48:36,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:48:36,222 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 246 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-07-20 05:48:36,224 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.6s Time] [2022-07-20 05:48:36,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-07-20 05:48:36,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 404. [2022-07-20 05:48:36,280 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-20 05:48:36,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 541 transitions. [2022-07-20 05:48:36,284 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 541 transitions. Word has length 3 [2022-07-20 05:48:36,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:48:36,284 INFO L495 AbstractCegarLoop]: Abstraction has 404 states and 541 transitions. [2022-07-20 05:48:36,285 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-20 05:48:36,285 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 541 transitions. [2022-07-20 05:48:36,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 05:48:36,285 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:48:36,285 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 05:48:36,299 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-20 05:48:36,495 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-20 05:48:36,495 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-20 05:48:36,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:48:36,496 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-20 05:48:36,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:48:36,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [523927995] [2022-07-20 05:48:36,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:36,497 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:48:36,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:48:36,498 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-20 05:48:36,505 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-20 05:48:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:36,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 05:48:36,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:48:36,564 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-20 05:48:36,573 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-20 05:48:36,573 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:48:36,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:48:36,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [523927995] [2022-07-20 05:48:36,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [523927995] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:48:36,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:48:36,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:48:36,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501073653] [2022-07-20 05:48:36,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:48:36,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:48:36,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:48:36,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:48:36,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:48:36,577 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-20 05:48:37,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:48:37,042 INFO L93 Difference]: Finished difference Result 405 states and 544 transitions. [2022-07-20 05:48:37,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:48:37,043 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-20 05:48:37,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:48:37,045 INFO L225 Difference]: With dead ends: 405 [2022-07-20 05:48:37,045 INFO L226 Difference]: Without dead ends: 405 [2022-07-20 05:48:37,046 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-20 05:48:37,047 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 6 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:48:37,047 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.5s Time] [2022-07-20 05:48:37,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-07-20 05:48:37,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 402. [2022-07-20 05:48:37,061 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-20 05:48:37,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 539 transitions. [2022-07-20 05:48:37,064 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 539 transitions. Word has length 3 [2022-07-20 05:48:37,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:48:37,064 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 539 transitions. [2022-07-20 05:48:37,065 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-20 05:48:37,065 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 539 transitions. [2022-07-20 05:48:37,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-20 05:48:37,065 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:48:37,065 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:48:37,078 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-20 05:48:37,274 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-20 05:48:37,274 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-20 05:48:37,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:48:37,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1117383211, now seen corresponding path program 1 times [2022-07-20 05:48:37,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:48:37,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1246477242] [2022-07-20 05:48:37,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:37,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:48:37,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:48:37,277 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-20 05:48:37,279 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-20 05:48:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:37,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 05:48:37,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:48:37,354 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-20 05:48:37,358 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-20 05:48:37,358 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:48:37,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:48:37,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1246477242] [2022-07-20 05:48:37,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1246477242] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:48:37,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:48:37,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:48:37,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642905902] [2022-07-20 05:48:37,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:48:37,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:48:37,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:48:37,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:48:37,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:48:37,360 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-20 05:48:37,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:48:37,669 INFO L93 Difference]: Finished difference Result 397 states and 534 transitions. [2022-07-20 05:48:37,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:48:37,669 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-20 05:48:37,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:48:37,671 INFO L225 Difference]: With dead ends: 397 [2022-07-20 05:48:37,671 INFO L226 Difference]: Without dead ends: 397 [2022-07-20 05:48:37,671 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-20 05:48:37,672 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-20 05:48:37,673 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-20 05:48:37,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-07-20 05:48:37,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2022-07-20 05:48:37,707 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-20 05:48:37,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 534 transitions. [2022-07-20 05:48:37,710 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 534 transitions. Word has length 10 [2022-07-20 05:48:37,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:48:37,711 INFO L495 AbstractCegarLoop]: Abstraction has 397 states and 534 transitions. [2022-07-20 05:48:37,712 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-20 05:48:37,712 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 534 transitions. [2022-07-20 05:48:37,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-20 05:48:37,712 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:48:37,712 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:48:37,727 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-20 05:48:37,923 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-20 05:48:37,923 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-20 05:48:37,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:48:37,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1117383212, now seen corresponding path program 1 times [2022-07-20 05:48:37,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:48:37,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1247790665] [2022-07-20 05:48:37,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:37,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:48:37,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:48:37,927 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-20 05:48:37,936 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-20 05:48:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:37,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 05:48:37,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:48:38,003 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-20 05:48:38,010 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-20 05:48:38,010 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:48:38,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:48:38,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1247790665] [2022-07-20 05:48:38,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1247790665] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:48:38,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:48:38,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:48:38,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240047566] [2022-07-20 05:48:38,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:48:38,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:48:38,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:48:38,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:48:38,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:48:38,013 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-20 05:48:38,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:48:38,440 INFO L93 Difference]: Finished difference Result 392 states and 529 transitions. [2022-07-20 05:48:38,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:48:38,441 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-20 05:48:38,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:48:38,443 INFO L225 Difference]: With dead ends: 392 [2022-07-20 05:48:38,443 INFO L226 Difference]: Without dead ends: 392 [2022-07-20 05:48:38,443 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-20 05:48:38,444 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 38 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:48:38,444 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.4s Time] [2022-07-20 05:48:38,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2022-07-20 05:48:38,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2022-07-20 05:48:38,452 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-20 05:48:38,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 529 transitions. [2022-07-20 05:48:38,455 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 529 transitions. Word has length 10 [2022-07-20 05:48:38,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:48:38,455 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 529 transitions. [2022-07-20 05:48:38,455 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-20 05:48:38,455 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 529 transitions. [2022-07-20 05:48:38,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 05:48:38,456 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:48:38,456 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:48:38,467 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-20 05:48:38,667 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-20 05:48:38,668 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-20 05:48:38,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:48:38,669 INFO L85 PathProgramCache]: Analyzing trace with hash 279141591, now seen corresponding path program 1 times [2022-07-20 05:48:38,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:48:38,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635479897] [2022-07-20 05:48:38,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:38,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:48:38,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:48:38,671 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-20 05:48:38,673 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-20 05:48:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:38,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 05:48:38,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:48:38,757 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-20 05:48:38,808 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-20 05:48:38,809 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-20 05:48:38,826 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-20 05:48:38,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:48:38,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:48:38,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635479897] [2022-07-20 05:48:38,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635479897] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:48:38,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:48:38,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:48:38,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583479004] [2022-07-20 05:48:38,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:48:38,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:48:38,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:48:38,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:48:38,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:48:38,828 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-20 05:48:39,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:48:39,685 INFO L93 Difference]: Finished difference Result 520 states and 571 transitions. [2022-07-20 05:48:39,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:48:39,686 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-20 05:48:39,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:48:39,688 INFO L225 Difference]: With dead ends: 520 [2022-07-20 05:48:39,688 INFO L226 Difference]: Without dead ends: 520 [2022-07-20 05:48:39,688 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-20 05:48:39,689 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 314 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2022-07-20 05:48:39,689 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.8s Time] [2022-07-20 05:48:39,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-07-20 05:48:39,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 384. [2022-07-20 05:48:39,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-20 05:48:39,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 521 transitions. [2022-07-20 05:48:39,699 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 521 transitions. Word has length 11 [2022-07-20 05:48:39,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:48:39,699 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 521 transitions. [2022-07-20 05:48:39,700 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-20 05:48:39,700 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 521 transitions. [2022-07-20 05:48:39,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 05:48:39,700 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:48:39,700 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:48:39,712 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-20 05:48:39,912 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-20 05:48:39,913 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-20 05:48:39,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:48:39,913 INFO L85 PathProgramCache]: Analyzing trace with hash 279141592, now seen corresponding path program 1 times [2022-07-20 05:48:39,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:48:39,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922988830] [2022-07-20 05:48:39,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:39,914 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:48:39,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:48:39,916 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-20 05:48:39,916 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-20 05:48:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:39,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-20 05:48:39,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:48:40,009 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-20 05:48:40,014 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-20 05:48:40,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:48:40,133 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-20 05:48:40,146 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:48:40,146 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-20 05:48:40,172 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-20 05:48:40,173 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:48:40,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:48:40,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1922988830] [2022-07-20 05:48:40,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1922988830] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:48:40,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:48:40,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:48:40,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766701887] [2022-07-20 05:48:40,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:48:40,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:48:40,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:48:40,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:48:40,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:48:40,175 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-20 05:48:41,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:48:41,382 INFO L93 Difference]: Finished difference Result 511 states and 562 transitions. [2022-07-20 05:48:41,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:48:41,382 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-20 05:48:41,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:48:41,384 INFO L225 Difference]: With dead ends: 511 [2022-07-20 05:48:41,385 INFO L226 Difference]: Without dead ends: 511 [2022-07-20 05:48:41,385 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-20 05:48:41,385 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 298 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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, 1.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:48:41,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 436 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-20 05:48:41,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2022-07-20 05:48:41,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 376. [2022-07-20 05:48:41,393 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-20 05:48:41,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 512 transitions. [2022-07-20 05:48:41,395 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 512 transitions. Word has length 11 [2022-07-20 05:48:41,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:48:41,395 INFO L495 AbstractCegarLoop]: Abstraction has 376 states and 512 transitions. [2022-07-20 05:48:41,395 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-20 05:48:41,395 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 512 transitions. [2022-07-20 05:48:41,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 05:48:41,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:48:41,396 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-20 05:48:41,409 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-20 05:48:41,605 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-20 05:48:41,605 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-20 05:48:41,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:48:41,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1241205510, now seen corresponding path program 1 times [2022-07-20 05:48:41,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:48:41,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794200300] [2022-07-20 05:48:41,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:41,607 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:48:41,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:48:41,608 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-20 05:48:41,610 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-20 05:48:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:41,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-20 05:48:41,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:48:41,737 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-20 05:48:41,755 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-20 05:48:41,770 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-20 05:48:41,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:48:41,796 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-20 05:48:41,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:48:41,806 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-20 05:48:41,876 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:48:41,877 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-20 05:48:41,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 14 treesize of output 16 [2022-07-20 05:48:41,918 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-20 05:48:41,945 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-20 05:48:41,948 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-20 05:48:41,976 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-20 05:48:41,976 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:48:41,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:48:41,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [794200300] [2022-07-20 05:48:41,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [794200300] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:48:41,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:48:41,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 05:48:41,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405657439] [2022-07-20 05:48:41,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:48:41,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 05:48:41,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:48:41,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 05:48:41,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:48:41,978 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-20 05:48:42,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:48:42,821 INFO L93 Difference]: Finished difference Result 396 states and 535 transitions. [2022-07-20 05:48:42,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 05:48:42,822 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-20 05:48:42,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:48:42,824 INFO L225 Difference]: With dead ends: 396 [2022-07-20 05:48:42,824 INFO L226 Difference]: Without dead ends: 396 [2022-07-20 05:48:42,824 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-20 05:48:42,825 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 25 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2022-07-20 05:48:42,825 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.8s Time] [2022-07-20 05:48:42,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-07-20 05:48:42,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 384. [2022-07-20 05:48:42,832 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-20 05:48:42,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 522 transitions. [2022-07-20 05:48:42,833 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 522 transitions. Word has length 20 [2022-07-20 05:48:42,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:48:42,833 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 522 transitions. [2022-07-20 05:48:42,833 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-20 05:48:42,833 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 522 transitions. [2022-07-20 05:48:42,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 05:48:42,834 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:48:42,834 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-20 05:48:42,850 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-20 05:48:43,034 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-20 05:48:43,035 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-20 05:48:43,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:48:43,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1158865353, now seen corresponding path program 1 times [2022-07-20 05:48:43,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:48:43,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1260173490] [2022-07-20 05:48:43,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:43,036 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:48:43,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:48:43,037 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-20 05:48:43,037 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-20 05:48:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:43,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-20 05:48:43,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:48:43,144 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-20 05:48:43,158 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-20 05:48:43,164 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-20 05:48:43,248 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:48:43,249 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-20 05:48:43,286 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-20 05:48:43,292 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-20 05:48:43,335 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-20 05:48:43,338 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-20 05:48:43,366 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-20 05:48:43,366 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:48:43,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:48:43,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1260173490] [2022-07-20 05:48:43,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1260173490] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:48:43,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:48:43,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 05:48:43,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366458084] [2022-07-20 05:48:43,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:48:43,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 05:48:43,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:48:43,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 05:48:43,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:48:43,368 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-20 05:48:44,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:48:44,600 INFO L93 Difference]: Finished difference Result 524 states and 577 transitions. [2022-07-20 05:48:44,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 05:48:44,601 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-20 05:48:44,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:48:44,603 INFO L225 Difference]: With dead ends: 524 [2022-07-20 05:48:44,603 INFO L226 Difference]: Without dead ends: 524 [2022-07-20 05:48:44,603 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-20 05:48:44,604 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 249 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:48:44,604 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.1s Time] [2022-07-20 05:48:44,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-07-20 05:48:44,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 387. [2022-07-20 05:48:44,612 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-20 05:48:44,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 525 transitions. [2022-07-20 05:48:44,613 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 525 transitions. Word has length 22 [2022-07-20 05:48:44,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:48:44,614 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 525 transitions. [2022-07-20 05:48:44,614 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-20 05:48:44,614 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 525 transitions. [2022-07-20 05:48:44,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 05:48:44,615 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:48:44,615 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-20 05:48:44,627 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-20 05:48:44,827 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-20 05:48:44,828 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-20 05:48:44,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:48:44,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1480107696, now seen corresponding path program 1 times [2022-07-20 05:48:44,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:48:44,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391670060] [2022-07-20 05:48:44,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:44,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:48:44,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:48:44,831 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-20 05:48:44,832 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-20 05:48:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:45,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-20 05:48:45,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:48:45,049 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-20 05:48:45,222 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-20 05:48:45,271 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:48:45,271 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-20 05:48:45,284 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-20 05:48:45,343 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:48:45,343 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-20 05:48:45,459 INFO L356 Elim1Store]: treesize reduction 75, result has 15.7 percent of original size [2022-07-20 05:48:45,459 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-20 05:48:45,473 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-07-20 05:48:45,473 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-20 05:48:45,593 INFO L356 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2022-07-20 05:48:45,594 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-20 05:48:45,655 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-20 05:48:45,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, 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-20 05:48:45,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, 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-20 05:48:45,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 32 treesize of output 14 [2022-07-20 05:48:45,871 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-20 05:48:45,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:48:45,936 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-20 05:48:45,999 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-20 05:48:46,015 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-20 05:48:46,231 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:46,231 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-20 05:48:46,236 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-20 05:48:46,245 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-20 05:48:46,252 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-20 05:48:50,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:48:50,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391670060] [2022-07-20 05:48:50,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391670060] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:48:50,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [956019130] [2022-07-20 05:48:50,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:50,827 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 05:48:50,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 05:48:50,829 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-20 05:48:50,830 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-20 05:48:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:51,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-20 05:48:51,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:48:51,319 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-20 05:48:51,320 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-20 05:48:51,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-20 05:48:51,516 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:48:51,517 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-20 05:48:51,522 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-20 05:48:51,559 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:48:51,560 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-20 05:48:51,644 INFO L356 Elim1Store]: treesize reduction 128, result has 20.5 percent of original size [2022-07-20 05:48:51,644 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-20 05:48:51,659 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-07-20 05:48:51,659 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-20 05:48:51,843 INFO L356 Elim1Store]: treesize reduction 65, result has 40.9 percent of original size [2022-07-20 05:48:51,844 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-20 05:48:51,917 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-20 05:48:52,073 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-20 05:48:52,132 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-20 05:48:52,193 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-20 05:48:52,255 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-20 05:48:52,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:48:52,375 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-20 05:48:52,391 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-20 05:48:52,542 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:48:52,542 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-20 05:48:52,546 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-20 05:48:52,554 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-20 05:48:52,561 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-20 05:48:54,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [956019130] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:48:54,754 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:48:54,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2022-07-20 05:48:54,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017444040] [2022-07-20 05:48:54,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:48:54,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-20 05:48:54,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:48:54,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-20 05:48:54,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=521, Unknown=8, NotChecked=250, Total=870 [2022-07-20 05:48:54,755 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-20 05:48:57,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:48:57,841 INFO L93 Difference]: Finished difference Result 529 states and 595 transitions. [2022-07-20 05:48:57,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 05:48:57,841 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-20 05:48:57,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:48:57,844 INFO L225 Difference]: With dead ends: 529 [2022-07-20 05:48:57,845 INFO L226 Difference]: Without dead ends: 529 [2022-07-20 05:48:57,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=200, Invalid=1002, Unknown=8, NotChecked=350, Total=1560 [2022-07-20 05:48:57,846 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 587 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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, 2.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:48:57,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 1927 Invalid, 2067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1752 Invalid, 0 Unknown, 171 Unchecked, 2.5s Time] [2022-07-20 05:48:57,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2022-07-20 05:48:57,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 392. [2022-07-20 05:48:57,857 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-20 05:48:57,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 529 transitions. [2022-07-20 05:48:57,859 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 529 transitions. Word has length 36 [2022-07-20 05:48:57,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:48:57,859 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 529 transitions. [2022-07-20 05:48:57,859 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-20 05:48:57,860 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 529 transitions. [2022-07-20 05:48:57,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 05:48:57,863 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:48:57,863 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-20 05:48:57,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2022-07-20 05:48:58,076 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-20 05:48:58,268 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-20 05:48:58,268 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-20 05:48:58,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:48:58,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1480107697, now seen corresponding path program 1 times [2022-07-20 05:48:58,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:48:58,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2076785627] [2022-07-20 05:48:58,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:58,269 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:48:58,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:48:58,270 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-20 05:48:58,271 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-20 05:48:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:58,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-20 05:48:58,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:48:58,491 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-20 05:48:58,527 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-20 05:48:58,698 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-20 05:48:58,705 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-20 05:48:58,757 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:48:58,757 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-20 05:48:58,764 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-20 05:48:58,787 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:48:58,788 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-20 05:48:58,797 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-20 05:48:58,864 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:48:58,865 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-20 05:48:58,887 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:48:58,887 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-20 05:48:59,014 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-07-20 05:48:59,015 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-20 05:48:59,133 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:48:59,133 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-20 05:48:59,154 INFO L356 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-07-20 05:48:59,154 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-20 05:48:59,213 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-20 05:48:59,225 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-20 05:48:59,325 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-20 05:48:59,332 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-20 05:48:59,372 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-20 05:48:59,380 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-20 05:48:59,451 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-20 05:48:59,454 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-20 05:48:59,480 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-20 05:48:59,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:48:59,673 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-20 05:49:01,826 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-20 05:49:04,834 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:49:04,834 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-20 05:49:04,839 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:49:04,841 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-20 05:49:04,856 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-20 05:49:04,856 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-20 05:49:04,863 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:49:04,863 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-20 05:49:06,796 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:49:06,797 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-20 05:49:06,825 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:49:06,825 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-20 05:49:06,916 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:49:06,916 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-20 05:49:07,028 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:49:07,029 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-20 05:49:07,052 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-20 05:49:07,071 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-20 05:49:07,087 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-20 05:49:07,103 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-20 05:49:12,909 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:49:12,909 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-20 05:49:13,032 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:49:13,033 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-20 05:49:13,063 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-20 05:49:13,091 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-20 05:49:37,966 WARN L233 SmtUtils]: Spent 17.37s on a formula simplification. DAG size of input: 100 DAG size of output: 62 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 05:49:47,265 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:49:47,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 89 treesize of output 197 [2022-07-20 05:49:55,508 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 61 treesize of output 59 [2022-07-20 05:49:56,013 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-20 05:49:56,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:49:56,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2076785627] [2022-07-20 05:49:56,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2076785627] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:49:56,013 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:49:56,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2022-07-20 05:49:56,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701135130] [2022-07-20 05:49:56,014 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:49:56,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-20 05:49:56,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:49:56,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-20 05:49:56,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=463, Unknown=15, NotChecked=90, Total=650 [2022-07-20 05:49:56,015 INFO L87 Difference]: Start difference. First operand 392 states and 529 transitions. Second operand has 26 states, 25 states have (on average 2.36) internal successors, (59), 22 states have internal predecessors, (59), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 05:49:57,003 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_append_#in~head.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_append_#in~head.base|) .cse3))) (and (not (= |c_append_#in~head.base| .cse0)) (= (select |c_#length| .cse0) (_ bv9 32)) (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 ((.cse1 (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 .cse1 (_ bv5 32)) (bvadd .cse1 (_ bv9 32))))) (forall ((v_ArrVal_426 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_427 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (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|) .cse2) (_ 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|) .cse2)))))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |c_#valid| |c_append_#in~head.base|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_append_#in~head.base|) .cse3) (_ bv0 32)) (= |c_#valid| |c_old(#valid)|)))) is different from false [2022-07-20 05:50:21,573 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 05:50:23,649 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 05:50:25,655 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 05:50:35,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:50:35,894 INFO L93 Difference]: Finished difference Result 825 states and 981 transitions. [2022-07-20 05:50:35,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-20 05:50:35,895 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.36) internal successors, (59), 22 states have internal predecessors, (59), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2022-07-20 05:50:35,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:50:35,903 INFO L225 Difference]: With dead ends: 825 [2022-07-20 05:50:35,903 INFO L226 Difference]: Without dead ends: 825 [2022-07-20 05:50:35,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 61.2s TimeCoverageRelationStatistics Valid=137, Invalid=661, Unknown=26, NotChecked=168, Total=992 [2022-07-20 05:50:35,905 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 830 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 1523 mSolverCounterSat, 124 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 4347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1523 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 2697 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:50:35,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 1712 Invalid, 4347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1523 Invalid, 3 Unknown, 2697 Unchecked, 16.5s Time] [2022-07-20 05:50:35,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2022-07-20 05:50:35,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 414. [2022-07-20 05:50:35,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 277 states have (on average 1.8808664259927799) internal successors, (521), 395 states have internal predecessors, (521), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (35), 17 states have call predecessors, (35), 18 states have call successors, (35) [2022-07-20 05:50:35,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 574 transitions. [2022-07-20 05:50:35,932 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 574 transitions. Word has length 36 [2022-07-20 05:50:35,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:50:35,933 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 574 transitions. [2022-07-20 05:50:35,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.36) internal successors, (59), 22 states have internal predecessors, (59), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 05:50:35,933 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 574 transitions. [2022-07-20 05:50:35,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 05:50:35,938 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:50:35,938 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] [2022-07-20 05:50:35,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-20 05:50:36,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:50:36,154 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-20 05:50:36,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:50:36,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1821652058, now seen corresponding path program 1 times [2022-07-20 05:50:36,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:50:36,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384915881] [2022-07-20 05:50:36,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:50:36,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:50:36,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:50:36,168 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:50:36,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-20 05:50:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:50:36,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-20 05:50:36,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:50:36,391 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-20 05:50:36,540 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-20 05:50:37,265 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-20 05:50:37,297 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-20 05:50:37,521 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:50:37,521 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-20 05:50:37,545 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-20 05:50:37,680 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:50:37,680 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-20 05:50:37,703 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-20 05:50:38,035 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:50:38,035 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-20 05:50:38,152 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:50:38,152 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-20 05:50:38,720 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-07-20 05:50:38,720 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-20 05:50:39,244 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:50:39,244 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-20 05:50:39,338 INFO L356 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-07-20 05:50:39,338 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-20 05:50:39,559 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-20 05:50:39,582 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-20 05:50:39,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 28 treesize of output 28 [2022-07-20 05:50:40,042 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-20 05:50:40,151 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-20 05:50:40,165 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-20 05:50:40,414 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-20 05:50:40,427 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-20 05:50:40,573 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-20 05:50:40,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:50:41,061 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_525 (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_525) c_append_~head.base) .cse0) (_ bv9 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_524) c_append_~head.base) .cse0))))) (forall ((v_ArrVal_525 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_525) 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-20 05:50:43,412 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_append_~node~0.base_34 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_append_~node~0.base_34)))) (and (forall ((v_ArrVal_524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_525 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_append_#in~head.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| v_append_~node~0.base_34 v_ArrVal_525) |c_append_#in~head.base|) .cse0) (_ bv9 32)) (select (store |c_#length| v_append_~node~0.base_34 (_ bv9 32)) (select (select (store |c_#memory_$Pointer$.base| v_append_~node~0.base_34 v_ArrVal_524) |c_append_#in~head.base|) .cse0))))) (forall ((v_ArrVal_525 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| v_append_~node~0.base_34 v_ArrVal_525) |c_append_#in~head.base|) (bvadd (_ bv4 32) |c_append_#in~head.offset|)))) (bvule (bvadd (_ bv5 32) .cse1) (bvadd .cse1 (_ bv9 32)))))))) is different from false [2022-07-20 05:50:49,353 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:50:49,354 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-20 05:50:49,368 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:50:49,379 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-20 05:50:49,432 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-20 05:50:49,432 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-20 05:50:49,485 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:50:49,485 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-20 05:50:51,467 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:50:51,467 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-20 05:50:51,501 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:50:51,502 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-20 05:50:51,583 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:50:51,583 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 146 treesize of output 149 [2022-07-20 05:50:51,689 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:50:51,689 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-20 05:50:51,708 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 758 [2022-07-20 05:50:51,732 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 394 treesize of output 362 [2022-07-20 05:50:51,756 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 694 [2022-07-20 05:50:51,773 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 694 treesize of output 630 [2022-07-20 05:50:58,090 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:50:58,091 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-20 05:50:58,201 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:50:58,201 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 208 treesize of output 193 [2022-07-20 05:50:58,214 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 142 [2022-07-20 05:50:58,238 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 79 treesize of output 63