./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 68e1c5cf050539b3ee8f058d38ff7af5aea2a400d05e41e0185e4509f45301e0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:09:32,113 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:09:32,116 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:09:32,155 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:09:32,155 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:09:32,156 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:09:32,158 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:09:32,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:09:32,161 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:09:32,165 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:09:32,165 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:09:32,167 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:09:32,167 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:09:32,169 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:09:32,169 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:09:32,172 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:09:32,173 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:09:32,173 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:09:32,175 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:09:32,177 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:09:32,179 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:09:32,180 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:09:32,181 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:09:32,181 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:09:32,182 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:09:32,186 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:09:32,186 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:09:32,186 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:09:32,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:09:32,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:09:32,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:09:32,188 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:09:32,189 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:09:32,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:09:32,190 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:09:32,191 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:09:32,191 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:09:32,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:09:32,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:09:32,192 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:09:32,192 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:09:32,193 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:09:32,194 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-07-12 18:09:32,215 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:09:32,215 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:09:32,215 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:09:32,215 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:09:32,216 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:09:32,216 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:09:32,216 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:09:32,216 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:09:32,216 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:09:32,217 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:09:32,217 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:09:32,217 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:09:32,218 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:09:32,218 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:09:32,218 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:09:32,218 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:09:32,218 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:09:32,218 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:09:32,218 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:09:32,219 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:09:32,219 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:09:32,219 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:09:32,219 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:09:32,219 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:09:32,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:09:32,220 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:09:32,220 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:09:32,220 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 18:09:32,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 18:09:32,220 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-memcleanup) ) 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 -> 68e1c5cf050539b3ee8f058d38ff7af5aea2a400d05e41e0185e4509f45301e0 [2022-07-12 18:09:32,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:09:32,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:09:32,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:09:32,426 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:09:32,426 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:09:32,428 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i [2022-07-12 18:09:32,476 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecf28c94c/3b1d4bb787024780bb8c59302070d85e/FLAGf2001b6cd [2022-07-12 18:09:32,866 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:09:32,866 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i [2022-07-12 18:09:32,878 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecf28c94c/3b1d4bb787024780bb8c59302070d85e/FLAGf2001b6cd [2022-07-12 18:09:33,272 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecf28c94c/3b1d4bb787024780bb8c59302070d85e [2022-07-12 18:09:33,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:09:33,274 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:09:33,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:09:33,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:09:33,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:09:33,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:09:33" (1/1) ... [2022-07-12 18:09:33,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64082c25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:09:33, skipping insertion in model container [2022-07-12 18:09:33,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:09:33" (1/1) ... [2022-07-12 18:09:33,284 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:09:33,310 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:09:33,588 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i[25013,25026] [2022-07-12 18:09:33,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:09:33,601 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:09:33,645 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i[25013,25026] [2022-07-12 18:09:33,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:09:33,669 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:09:33,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:09:33 WrapperNode [2022-07-12 18:09:33,671 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:09:33,671 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:09:33,672 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:09:33,672 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:09:33,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:09:33" (1/1) ... [2022-07-12 18:09:33,700 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:09:33" (1/1) ... [2022-07-12 18:09:33,723 INFO L137 Inliner]: procedures = 129, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 186 [2022-07-12 18:09:33,724 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:09:33,724 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:09:33,724 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:09:33,725 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:09:33,730 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:09:33" (1/1) ... [2022-07-12 18:09:33,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:09:33" (1/1) ... [2022-07-12 18:09:33,732 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:09:33" (1/1) ... [2022-07-12 18:09:33,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:09:33" (1/1) ... [2022-07-12 18:09:33,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:09:33" (1/1) ... [2022-07-12 18:09:33,755 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:09:33" (1/1) ... [2022-07-12 18:09:33,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:09:33" (1/1) ... [2022-07-12 18:09:33,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:09:33,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:09:33,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:09:33,768 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:09:33,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:09:33" (1/1) ... [2022-07-12 18:09:33,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:09:33,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:09:33,790 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-12 18:09:33,791 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-12 18:09:33,813 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-12 18:09:33,814 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-12 18:09:33,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 18:09:33,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 18:09:33,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 18:09:33,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 18:09:33,815 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2022-07-12 18:09:33,815 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2022-07-12 18:09:33,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 18:09:33,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:09:33,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 18:09:33,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 18:09:33,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:09:33,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:09:33,936 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:09:33,938 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:09:33,988 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-12 18:09:34,230 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:09:34,235 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:09:34,236 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-07-12 18:09:34,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:09:34 BoogieIcfgContainer [2022-07-12 18:09:34,237 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:09:34,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:09:34,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:09:34,257 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:09:34,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:09:33" (1/3) ... [2022-07-12 18:09:34,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68166a18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:09:34, skipping insertion in model container [2022-07-12 18:09:34,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:09:33" (2/3) ... [2022-07-12 18:09:34,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68166a18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:09:34, skipping insertion in model container [2022-07-12 18:09:34,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:09:34" (3/3) ... [2022-07-12 18:09:34,260 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-2.i [2022-07-12 18:09:34,269 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:09:34,271 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2022-07-12 18:09:34,313 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:09:34,319 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@433dd73b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@266cd3e0 [2022-07-12 18:09:34,320 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2022-07-12 18:09:34,325 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 73 states have (on average 1.9315068493150684) internal successors, (141), 116 states have internal predecessors, (141), 4 states have call successors, (4), 2 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-12 18:09:34,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 18:09:34,329 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:34,329 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:34,330 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-12 18:09:34,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:34,333 INFO L85 PathProgramCache]: Analyzing trace with hash -46006015, now seen corresponding path program 1 times [2022-07-12 18:09:34,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:09:34,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577483790] [2022-07-12 18:09:34,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:34,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:09:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:34,470 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-12 18:09:34,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:09:34,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577483790] [2022-07-12 18:09:34,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577483790] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:09:34,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:09:34,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:09:34,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363613689] [2022-07-12 18:09:34,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:09:34,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:09:34,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:09:34,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:09:34,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:09:34,500 INFO L87 Difference]: Start difference. First operand has 121 states, 73 states have (on average 1.9315068493150684) internal successors, (141), 116 states have internal predecessors, (141), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.0) 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-12 18:09:34,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:34,553 INFO L93 Difference]: Finished difference Result 128 states and 147 transitions. [2022-07-12 18:09:34,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:09:34,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) 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-12 18:09:34,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:34,562 INFO L225 Difference]: With dead ends: 128 [2022-07-12 18:09:34,562 INFO L226 Difference]: Without dead ends: 122 [2022-07-12 18:09:34,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:09:34,572 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 7 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:34,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 258 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:09:34,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-12 18:09:34,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 116. [2022-07-12 18:09:34,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 71 states have (on average 1.7746478873239437) internal successors, (126), 112 states have internal predecessors, (126), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:09:34,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 130 transitions. [2022-07-12 18:09:34,616 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 130 transitions. Word has length 10 [2022-07-12 18:09:34,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:34,617 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 130 transitions. [2022-07-12 18:09:34,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) 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-12 18:09:34,617 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 130 transitions. [2022-07-12 18:09:34,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 18:09:34,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:34,619 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:34,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 18:09:34,619 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-12 18:09:34,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:34,622 INFO L85 PathProgramCache]: Analyzing trace with hash 244152622, now seen corresponding path program 1 times [2022-07-12 18:09:34,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:09:34,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705921424] [2022-07-12 18:09:34,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:34,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:09:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:34,690 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-12 18:09:34,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:09:34,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705921424] [2022-07-12 18:09:34,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705921424] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:09:34,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:09:34,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:09:34,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968196075] [2022-07-12 18:09:34,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:09:34,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:09:34,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:09:34,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:09:34,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:09:34,693 INFO L87 Difference]: Start difference. First operand 116 states and 130 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-12 18:09:34,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:34,801 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2022-07-12 18:09:34,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:09:34,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 13 [2022-07-12 18:09:34,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:34,804 INFO L225 Difference]: With dead ends: 151 [2022-07-12 18:09:34,804 INFO L226 Difference]: Without dead ends: 151 [2022-07-12 18:09:34,804 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-12 18:09:34,805 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 40 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:34,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 234 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:09:34,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-12 18:09:34,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 115. [2022-07-12 18:09:34,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 71 states have (on average 1.7605633802816902) internal successors, (125), 111 states have internal predecessors, (125), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:09:34,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2022-07-12 18:09:34,812 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 13 [2022-07-12 18:09:34,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:34,813 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2022-07-12 18:09:34,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-12 18:09:34,813 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2022-07-12 18:09:34,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 18:09:34,813 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:34,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:34,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 18:09:34,814 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-12 18:09:34,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:34,815 INFO L85 PathProgramCache]: Analyzing trace with hash 244152621, now seen corresponding path program 1 times [2022-07-12 18:09:34,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:09:34,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025630086] [2022-07-12 18:09:34,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:34,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:09:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:34,863 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-12 18:09:34,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:09:34,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025630086] [2022-07-12 18:09:34,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025630086] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:09:34,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:09:34,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:09:34,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045864925] [2022-07-12 18:09:34,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:09:34,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:09:34,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:09:34,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:09:34,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:09:34,866 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-12 18:09:34,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:34,941 INFO L93 Difference]: Finished difference Result 150 states and 168 transitions. [2022-07-12 18:09:34,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:09:34,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 13 [2022-07-12 18:09:34,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:34,943 INFO L225 Difference]: With dead ends: 150 [2022-07-12 18:09:34,943 INFO L226 Difference]: Without dead ends: 150 [2022-07-12 18:09:34,943 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-12 18:09:34,944 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 39 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:34,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 228 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:09:34,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-12 18:09:34,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 114. [2022-07-12 18:09:34,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 71 states have (on average 1.7464788732394365) internal successors, (124), 110 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:09:34,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2022-07-12 18:09:34,955 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 13 [2022-07-12 18:09:34,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:34,955 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2022-07-12 18:09:34,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-12 18:09:34,958 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2022-07-12 18:09:34,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 18:09:34,959 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:34,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:34,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 18:09:34,959 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-12 18:09:34,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:34,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1021253985, now seen corresponding path program 1 times [2022-07-12 18:09:34,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:09:34,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353764623] [2022-07-12 18:09:34,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:34,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:09:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:35,009 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-12 18:09:35,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:09:35,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353764623] [2022-07-12 18:09:35,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353764623] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:09:35,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:09:35,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:09:35,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740721] [2022-07-12 18:09:35,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:09:35,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:09:35,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:09:35,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:09:35,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:09:35,013 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-12 18:09:35,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:35,062 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2022-07-12 18:09:35,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:09:35,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 14 [2022-07-12 18:09:35,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:35,063 INFO L225 Difference]: With dead ends: 112 [2022-07-12 18:09:35,063 INFO L226 Difference]: Without dead ends: 112 [2022-07-12 18:09:35,063 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-12 18:09:35,067 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 35 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:35,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 162 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:09:35,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-12 18:09:35,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-07-12 18:09:35,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 71 states have (on average 1.7183098591549295) internal successors, (122), 108 states have internal predecessors, (122), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:09:35,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2022-07-12 18:09:35,078 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 14 [2022-07-12 18:09:35,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:35,078 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2022-07-12 18:09:35,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-12 18:09:35,078 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2022-07-12 18:09:35,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 18:09:35,079 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:35,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:35,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 18:09:35,079 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting sll_appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-12 18:09:35,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:35,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1021253984, now seen corresponding path program 1 times [2022-07-12 18:09:35,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:09:35,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570998273] [2022-07-12 18:09:35,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:35,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:09:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:35,120 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-12 18:09:35,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:09:35,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570998273] [2022-07-12 18:09:35,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570998273] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:09:35,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:09:35,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:09:35,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277178259] [2022-07-12 18:09:35,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:09:35,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:09:35,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:09:35,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:09:35,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:09:35,123 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-12 18:09:35,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:35,190 INFO L93 Difference]: Finished difference Result 213 states and 236 transitions. [2022-07-12 18:09:35,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:09:35,191 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 14 [2022-07-12 18:09:35,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:35,192 INFO L225 Difference]: With dead ends: 213 [2022-07-12 18:09:35,192 INFO L226 Difference]: Without dead ends: 213 [2022-07-12 18:09:35,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:09:35,193 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 160 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:35,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 889 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:09:35,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-07-12 18:09:35,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 139. [2022-07-12 18:09:35,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 97 states have (on average 1.7010309278350515) internal successors, (165), 134 states have internal predecessors, (165), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:09:35,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 169 transitions. [2022-07-12 18:09:35,200 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 169 transitions. Word has length 14 [2022-07-12 18:09:35,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:35,201 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 169 transitions. [2022-07-12 18:09:35,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-12 18:09:35,201 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 169 transitions. [2022-07-12 18:09:35,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 18:09:35,201 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:35,202 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:35,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 18:09:35,202 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting sll_appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-12 18:09:35,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:35,202 INFO L85 PathProgramCache]: Analyzing trace with hash -790832604, now seen corresponding path program 1 times [2022-07-12 18:09:35,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:09:35,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68510750] [2022-07-12 18:09:35,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:35,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:09:35,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:35,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:35,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:09:35,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68510750] [2022-07-12 18:09:35,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68510750] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:09:35,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309212244] [2022-07-12 18:09:35,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:35,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:09:35,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:09:35,237 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-12 18:09:35,238 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-12 18:09:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:35,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 18:09:35,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:09:35,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:35,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:09:35,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:35,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309212244] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:09:35,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:09:35,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-12 18:09:35,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780890662] [2022-07-12 18:09:35,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:09:35,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:09:35,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:09:35,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:09:35,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:09:35,363 INFO L87 Difference]: Start difference. First operand 139 states and 169 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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-12 18:09:35,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:35,424 INFO L93 Difference]: Finished difference Result 192 states and 229 transitions. [2022-07-12 18:09:35,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:09:35,424 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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 16 [2022-07-12 18:09:35,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:35,425 INFO L225 Difference]: With dead ends: 192 [2022-07-12 18:09:35,425 INFO L226 Difference]: Without dead ends: 192 [2022-07-12 18:09:35,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:09:35,426 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 91 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:35,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 515 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:09:35,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-12 18:09:35,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 156. [2022-07-12 18:09:35,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 112 states have (on average 1.6517857142857142) internal successors, (185), 149 states have internal predecessors, (185), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:09:35,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 193 transitions. [2022-07-12 18:09:35,433 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 193 transitions. Word has length 16 [2022-07-12 18:09:35,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:35,433 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 193 transitions. [2022-07-12 18:09:35,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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-12 18:09:35,434 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 193 transitions. [2022-07-12 18:09:35,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 18:09:35,434 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:35,435 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:35,455 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-12 18:09:35,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-12 18:09:35,652 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting sll_appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-12 18:09:35,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:35,653 INFO L85 PathProgramCache]: Analyzing trace with hash -924446423, now seen corresponding path program 1 times [2022-07-12 18:09:35,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:09:35,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880714553] [2022-07-12 18:09:35,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:35,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:09:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:35,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:35,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:09:35,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880714553] [2022-07-12 18:09:35,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880714553] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:09:35,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721667238] [2022-07-12 18:09:35,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:35,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:09:35,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:09:35,734 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-12 18:09:35,735 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-12 18:09:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:35,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 18:09:35,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:09:35,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:35,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:09:35,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:35,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721667238] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:09:35,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:09:35,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-12 18:09:35,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830634148] [2022-07-12 18:09:35,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:09:35,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 18:09:35,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:09:35,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 18:09:35,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:09:35,881 INFO L87 Difference]: Start difference. First operand 156 states and 193 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:09:35,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:35,996 INFO L93 Difference]: Finished difference Result 238 states and 269 transitions. [2022-07-12 18:09:35,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:09:35,996 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-12 18:09:35,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:35,998 INFO L225 Difference]: With dead ends: 238 [2022-07-12 18:09:35,998 INFO L226 Difference]: Without dead ends: 238 [2022-07-12 18:09:35,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-07-12 18:09:35,999 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 291 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:35,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 1261 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:09:36,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-07-12 18:09:36,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 164. [2022-07-12 18:09:36,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 120 states have (on average 1.6083333333333334) internal successors, (193), 157 states have internal predecessors, (193), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:09:36,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 201 transitions. [2022-07-12 18:09:36,006 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 201 transitions. Word has length 18 [2022-07-12 18:09:36,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:36,006 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 201 transitions. [2022-07-12 18:09:36,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:09:36,006 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 201 transitions. [2022-07-12 18:09:36,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 18:09:36,007 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:36,007 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:36,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 18:09:36,224 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,SelfDestructingSolverStorable6 [2022-07-12 18:09:36,227 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting sll_appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-12 18:09:36,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:36,228 INFO L85 PathProgramCache]: Analyzing trace with hash 760370116, now seen corresponding path program 2 times [2022-07-12 18:09:36,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:09:36,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891344905] [2022-07-12 18:09:36,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:36,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:09:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:36,276 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-12 18:09:36,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:09:36,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891344905] [2022-07-12 18:09:36,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891344905] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:09:36,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:09:36,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:09:36,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783909215] [2022-07-12 18:09:36,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:09:36,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:09:36,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:09:36,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:09:36,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:09:36,278 INFO L87 Difference]: Start difference. First operand 164 states and 201 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-12 18:09:36,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:36,306 INFO L93 Difference]: Finished difference Result 182 states and 205 transitions. [2022-07-12 18:09:36,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:09:36,306 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-12 18:09:36,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:36,307 INFO L225 Difference]: With dead ends: 182 [2022-07-12 18:09:36,308 INFO L226 Difference]: Without dead ends: 182 [2022-07-12 18:09:36,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:09:36,310 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 162 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:36,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 638 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:09:36,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-07-12 18:09:36,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2022-07-12 18:09:36,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 121 states have (on average 1.603305785123967) internal successors, (194), 158 states have internal predecessors, (194), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:09:36,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 202 transitions. [2022-07-12 18:09:36,317 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 202 transitions. Word has length 26 [2022-07-12 18:09:36,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:36,318 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 202 transitions. [2022-07-12 18:09:36,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-12 18:09:36,318 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 202 transitions. [2022-07-12 18:09:36,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 18:09:36,320 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:36,321 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:36,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 18:09:36,331 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting sll_appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-12 18:09:36,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:36,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1087676229, now seen corresponding path program 2 times [2022-07-12 18:09:36,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:09:36,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685404030] [2022-07-12 18:09:36,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:36,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:09:36,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:36,456 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 18:09:36,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:09:36,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685404030] [2022-07-12 18:09:36,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685404030] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:09:36,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481020119] [2022-07-12 18:09:36,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:09:36,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:09:36,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:09:36,472 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-12 18:09:36,527 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-12 18:09:36,629 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:09:36,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:09:36,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 18:09:36,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:09:36,654 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-12 18:09:36,659 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-12 18:09:36,722 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 18:09:36,723 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 17 treesize of output 21 [2022-07-12 18:09:36,729 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-12 18:09:36,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:36,762 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-12 18:09:36,768 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:09:36,769 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-12 18:09:36,795 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:09:36,796 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 18 [2022-07-12 18:09:36,840 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 18:09:36,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:09:37,273 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:09:37,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481020119] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:09:37,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:09:37,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 4] total 8 [2022-07-12 18:09:37,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679040811] [2022-07-12 18:09:37,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:09:37,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:09:37,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:09:37,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:09:37,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:09:37,274 INFO L87 Difference]: Start difference. First operand 165 states and 202 transitions. Second operand has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 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-12 18:09:37,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:37,310 INFO L93 Difference]: Finished difference Result 163 states and 198 transitions. [2022-07-12 18:09:37,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:09:37,311 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-12 18:09:37,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:37,311 INFO L225 Difference]: With dead ends: 163 [2022-07-12 18:09:37,311 INFO L226 Difference]: Without dead ends: 163 [2022-07-12 18:09:37,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:09:37,312 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 171 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:37,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 272 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 55 Unchecked, 0.0s Time] [2022-07-12 18:09:37,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-12 18:09:37,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2022-07-12 18:09:37,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 121 states have (on average 1.5702479338842976) internal successors, (190), 156 states have internal predecessors, (190), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:09:37,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 198 transitions. [2022-07-12 18:09:37,315 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 198 transitions. Word has length 26 [2022-07-12 18:09:37,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:37,315 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 198 transitions. [2022-07-12 18:09:37,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 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-12 18:09:37,315 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 198 transitions. [2022-07-12 18:09:37,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-12 18:09:37,316 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:37,316 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:37,335 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-12 18:09:37,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:09:37,523 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting sll_appendErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-12 18:09:37,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:37,524 INFO L85 PathProgramCache]: Analyzing trace with hash 320066679, now seen corresponding path program 1 times [2022-07-12 18:09:37,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:09:37,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728278361] [2022-07-12 18:09:37,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:37,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:09:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:37,567 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 18:09:37,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:09:37,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728278361] [2022-07-12 18:09:37,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728278361] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:09:37,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:09:37,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:09:37,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906043460] [2022-07-12 18:09:37,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:09:37,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:09:37,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:09:37,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:09:37,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:09:37,570 INFO L87 Difference]: Start difference. First operand 163 states and 198 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-12 18:09:37,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:37,642 INFO L93 Difference]: Finished difference Result 162 states and 196 transitions. [2022-07-12 18:09:37,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:09:37,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 31 [2022-07-12 18:09:37,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:37,644 INFO L225 Difference]: With dead ends: 162 [2022-07-12 18:09:37,644 INFO L226 Difference]: Without dead ends: 162 [2022-07-12 18:09:37,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:09:37,645 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 83 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:37,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 288 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:09:37,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-12 18:09:37,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2022-07-12 18:09:37,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 121 states have (on average 1.5537190082644627) internal successors, (188), 155 states have internal predecessors, (188), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:09:37,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 196 transitions. [2022-07-12 18:09:37,648 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 196 transitions. Word has length 31 [2022-07-12 18:09:37,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:37,649 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 196 transitions. [2022-07-12 18:09:37,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-12 18:09:37,649 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 196 transitions. [2022-07-12 18:09:37,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-12 18:09:37,650 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:37,650 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:37,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 18:09:37,650 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting sll_appendErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-12 18:09:37,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:37,650 INFO L85 PathProgramCache]: Analyzing trace with hash 320066680, now seen corresponding path program 1 times [2022-07-12 18:09:37,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:09:37,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429730013] [2022-07-12 18:09:37,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:37,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:09:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:37,734 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 18:09:37,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:09:37,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429730013] [2022-07-12 18:09:37,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429730013] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:09:37,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:09:37,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:09:37,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145871009] [2022-07-12 18:09:37,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:09:37,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:09:37,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:09:37,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:09:37,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:09:37,736 INFO L87 Difference]: Start difference. First operand 162 states and 196 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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-12 18:09:37,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:37,795 INFO L93 Difference]: Finished difference Result 161 states and 194 transitions. [2022-07-12 18:09:37,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:09:37,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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 31 [2022-07-12 18:09:37,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:37,797 INFO L225 Difference]: With dead ends: 161 [2022-07-12 18:09:37,797 INFO L226 Difference]: Without dead ends: 161 [2022-07-12 18:09:37,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:09:37,797 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 108 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:37,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 326 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:09:37,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-12 18:09:37,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2022-07-12 18:09:37,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 121 states have (on average 1.537190082644628) internal successors, (186), 154 states have internal predecessors, (186), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:09:37,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 194 transitions. [2022-07-12 18:09:37,802 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 194 transitions. Word has length 31 [2022-07-12 18:09:37,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:37,802 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 194 transitions. [2022-07-12 18:09:37,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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-12 18:09:37,802 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 194 transitions. [2022-07-12 18:09:37,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 18:09:37,803 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:37,804 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:37,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 18:09:37,804 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting sll_appendErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-12 18:09:37,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:37,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1332132480, now seen corresponding path program 1 times [2022-07-12 18:09:37,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:09:37,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576190564] [2022-07-12 18:09:37,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:37,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:09:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:37,938 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 18:09:37,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:09:37,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576190564] [2022-07-12 18:09:37,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576190564] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:09:37,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138262441] [2022-07-12 18:09:37,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:37,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:09:37,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:09:37,940 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-12 18:09:37,941 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-12 18:09:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:38,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-12 18:09:38,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:09:38,029 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-12 18:09:38,052 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:09:38,053 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 18 [2022-07-12 18:09:38,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:38,114 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 16 treesize of output 18 [2022-07-12 18:09:38,129 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:09:38,130 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 16 treesize of output 22 [2022-07-12 18:09:38,181 INFO L356 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-07-12 18:09:38,181 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 3 case distinctions, treesize of input 21 treesize of output 38 [2022-07-12 18:09:38,272 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 18:09:38,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:09:38,483 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 18:09:38,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138262441] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:09:38,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:09:38,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 17 [2022-07-12 18:09:38,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459294465] [2022-07-12 18:09:38,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:09:38,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 18:09:38,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:09:38,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 18:09:38,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-07-12 18:09:38,485 INFO L87 Difference]: Start difference. First operand 161 states and 194 transitions. Second operand has 18 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:09:38,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:38,688 INFO L93 Difference]: Finished difference Result 222 states and 267 transitions. [2022-07-12 18:09:38,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:09:38,689 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-12 18:09:38,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:38,690 INFO L225 Difference]: With dead ends: 222 [2022-07-12 18:09:38,690 INFO L226 Difference]: Without dead ends: 222 [2022-07-12 18:09:38,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-07-12 18:09:38,691 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 283 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:38,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 782 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 341 Invalid, 0 Unknown, 164 Unchecked, 0.2s Time] [2022-07-12 18:09:38,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-07-12 18:09:38,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 213. [2022-07-12 18:09:38,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 170 states have (on average 1.4764705882352942) internal successors, (251), 205 states have internal predecessors, (251), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-12 18:09:38,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 265 transitions. [2022-07-12 18:09:38,695 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 265 transitions. Word has length 32 [2022-07-12 18:09:38,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:38,695 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 265 transitions. [2022-07-12 18:09:38,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:09:38,695 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 265 transitions. [2022-07-12 18:09:38,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 18:09:38,696 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:38,696 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:38,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 18:09:38,896 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-12 18:09:38,897 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting sll_appendErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-12 18:09:38,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:38,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1332132481, now seen corresponding path program 1 times [2022-07-12 18:09:38,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:09:38,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461283336] [2022-07-12 18:09:38,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:38,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:09:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:39,000 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 18:09:39,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:09:39,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461283336] [2022-07-12 18:09:39,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461283336] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:09:39,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821960835] [2022-07-12 18:09:39,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:39,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:09:39,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:09:39,002 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-12 18:09:39,003 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-12 18:09:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:39,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 18:09:39,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:09:39,095 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-12 18:09:39,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:39,134 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-12 18:09:39,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:39,150 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-12 18:09:39,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:39,189 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-12 18:09:39,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:39,206 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-12 18:09:39,228 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 18:09:39,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:09:39,736 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 18:09:39,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821960835] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:09:39,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:09:39,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-07-12 18:09:39,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56926569] [2022-07-12 18:09:39,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:09:39,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:09:39,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:09:39,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:09:39,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:09:39,738 INFO L87 Difference]: Start difference. First operand 213 states and 265 transitions. Second operand has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:09:39,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:39,835 INFO L93 Difference]: Finished difference Result 219 states and 263 transitions. [2022-07-12 18:09:39,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:09:39,836 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-12 18:09:39,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:39,837 INFO L225 Difference]: With dead ends: 219 [2022-07-12 18:09:39,837 INFO L226 Difference]: Without dead ends: 219 [2022-07-12 18:09:39,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:09:39,838 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 68 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:39,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 481 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 147 Invalid, 0 Unknown, 99 Unchecked, 0.1s Time] [2022-07-12 18:09:39,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-07-12 18:09:39,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 212. [2022-07-12 18:09:39,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 170 states have (on average 1.4529411764705882) internal successors, (247), 204 states have internal predecessors, (247), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-12 18:09:39,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 261 transitions. [2022-07-12 18:09:39,842 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 261 transitions. Word has length 32 [2022-07-12 18:09:39,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:39,843 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 261 transitions. [2022-07-12 18:09:39,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:09:39,843 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 261 transitions. [2022-07-12 18:09:39,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 18:09:39,844 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:39,844 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-07-12 18:09:39,862 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-12 18:09:40,059 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-12 18:09:40,059 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting sll_appendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-12 18:09:40,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:40,060 INFO L85 PathProgramCache]: Analyzing trace with hash 60922559, now seen corresponding path program 1 times [2022-07-12 18:09:40,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:09:40,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949245362] [2022-07-12 18:09:40,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:40,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:09:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:40,277 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 18:09:40,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:09:40,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949245362] [2022-07-12 18:09:40,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949245362] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:09:40,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892646023] [2022-07-12 18:09:40,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:40,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:09:40,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:09:40,278 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-12 18:09:40,296 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-12 18:09:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:40,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-12 18:09:40,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:09:40,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:40,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 18:09:40,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:40,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:09:40,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:40,661 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 19 treesize of output 18 [2022-07-12 18:09:40,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:40,666 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-12 18:09:40,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:40,824 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-12 18:09:40,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:40,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:40,834 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 18:09:40,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2022-07-12 18:09:40,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:40,925 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-12 18:09:40,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:40,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:40,943 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:09:40,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2022-07-12 18:09:40,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:40,988 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-12 18:09:40,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:40,994 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-12 18:09:41,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:41,056 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-12 18:09:41,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:41,059 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-12 18:09:41,082 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-12 18:09:41,084 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-12 18:09:41,089 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:41,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:09:41,104 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_~new_last~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_~new_last~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-07-12 18:09:41,126 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_503 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_#res#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|))) (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_#res#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-07-12 18:09:41,139 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-07-12 18:09:41,168 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|)))) is different from false [2022-07-12 18:09:41,181 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-12 18:09:41,191 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|))))) is different from false [2022-07-12 18:09:41,203 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-12 18:09:41,234 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 |c_sll_append_sll_create_~head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|))))) is different from false [2022-07-12 18:09:41,260 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|))))) is different from false [2022-07-12 18:09:41,344 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_492 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_491 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|))))) is different from false [2022-07-12 18:09:41,416 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (forall ((v_ArrVal_491 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_492 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|))))))) is different from false [2022-07-12 18:09:41,506 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (forall ((v_ArrVal_492 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_503) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_491 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_504) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|))))) is different from false [2022-07-12 18:09:41,545 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_492 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_503) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_491 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= 0 (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_504) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|))))) is different from false [2022-07-12 18:09:41,717 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-07-12 18:09:41,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892646023] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:09:41,718 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:09:41,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 18] total 41 [2022-07-12 18:09:41,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196516392] [2022-07-12 18:09:41,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:09:41,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-12 18:09:41,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:09:41,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-12 18:09:41,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=632, Unknown=13, NotChecked=832, Total=1640 [2022-07-12 18:09:41,720 INFO L87 Difference]: Start difference. First operand 212 states and 261 transitions. Second operand has 41 states, 41 states have (on average 2.1707317073170733) internal successors, (89), 38 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:09:41,730 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_492 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_503) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|)))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_491 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= 0 (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_504) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#head~1#1.base|)) is different from false [2022-07-12 18:09:41,737 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_sll_append_#in~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_sll_append_#in~head#1.base|))) (and (= |c_sll_append_#in~head#1.offset| 0) (= (select .cse0 0) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_sll_append_#in~head#1.base|) (< |c_#StackHeapBarrier| |c_sll_append_#in~head#1.base|) (= (select .cse1 |c_sll_append_#in~head#1.offset|) 0) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (forall ((v_ArrVal_492 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_492))) (store .cse3 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse3 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 0))))) (store .cse2 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse2 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_503) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|)))) (= (select .cse1 0) 0) (= (select |c_#valid| |c_sll_append_#in~head#1.base|) 1) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_491 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_504) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|)))) (= (select .cse0 |c_sll_append_#in~head#1.offset|) 0))) is different from false [2022-07-12 18:09:41,742 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (forall ((v_ArrVal_491 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_492 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-12 18:09:41,746 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (forall ((v_ArrVal_492 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((v_ArrVal_491 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-12 18:09:43,762 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-12 18:09:43,772 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 |c_sll_append_sll_create_~head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-12 18:09:45,775 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-12 18:09:45,786 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (exists ((|sll_append_sll_create_~new_head~0#1.base| Int)) (and (< |sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset|) 0))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-12 18:09:45,790 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|sll_append_sll_create_~new_head~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~head~0#1.offset|) 0) (< |sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|))) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-12 18:09:47,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:47,194 INFO L93 Difference]: Finished difference Result 264 states and 321 transitions. [2022-07-12 18:09:47,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 18:09:47,195 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.1707317073170733) internal successors, (89), 38 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-12 18:09:47,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:47,196 INFO L225 Difference]: With dead ends: 264 [2022-07-12 18:09:47,196 INFO L226 Difference]: Without dead ends: 264 [2022-07-12 18:09:47,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=243, Invalid=1083, Unknown=22, NotChecked=1958, Total=3306 [2022-07-12 18:09:47,197 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 26 mSDsluCounter, 2142 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2238 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 551 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:47,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2238 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 336 Invalid, 0 Unknown, 551 Unchecked, 0.2s Time] [2022-07-12 18:09:47,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-07-12 18:09:47,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 243. [2022-07-12 18:09:47,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 199 states have (on average 1.3969849246231156) internal successors, (278), 234 states have internal predecessors, (278), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (11), 4 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-12 18:09:47,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 297 transitions. [2022-07-12 18:09:47,203 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 297 transitions. Word has length 35 [2022-07-12 18:09:47,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:47,203 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 297 transitions. [2022-07-12 18:09:47,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.1707317073170733) internal successors, (89), 38 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:09:47,203 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 297 transitions. [2022-07-12 18:09:47,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 18:09:47,204 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:47,204 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-07-12 18:09:47,223 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-12 18:09:47,416 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-12 18:09:47,417 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting sll_appendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-12 18:09:47,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:47,417 INFO L85 PathProgramCache]: Analyzing trace with hash 762522433, now seen corresponding path program 1 times [2022-07-12 18:09:47,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:09:47,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912940020] [2022-07-12 18:09:47,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:47,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:09:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:47,437 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 18:09:47,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:09:47,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912940020] [2022-07-12 18:09:47,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912940020] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:09:47,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:09:47,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:09:47,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310074995] [2022-07-12 18:09:47,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:09:47,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:09:47,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:09:47,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:09:47,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:09:47,439 INFO L87 Difference]: Start difference. First operand 243 states and 297 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-12 18:09:47,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:47,445 INFO L93 Difference]: Finished difference Result 247 states and 298 transitions. [2022-07-12 18:09:47,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:09:47,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 35 [2022-07-12 18:09:47,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:47,447 INFO L225 Difference]: With dead ends: 247 [2022-07-12 18:09:47,447 INFO L226 Difference]: Without dead ends: 247 [2022-07-12 18:09:47,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:09:47,449 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:47,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:09:47,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-12 18:09:47,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2022-07-12 18:09:47,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 204 states have (on average 1.3823529411764706) internal successors, (282), 238 states have internal predecessors, (282), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-12 18:09:47,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 298 transitions. [2022-07-12 18:09:47,454 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 298 transitions. Word has length 35 [2022-07-12 18:09:47,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:47,454 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 298 transitions. [2022-07-12 18:09:47,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-12 18:09:47,455 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 298 transitions. [2022-07-12 18:09:47,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 18:09:47,455 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:47,455 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:47,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 18:09:47,456 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting sll_appendErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-12 18:09:47,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:47,456 INFO L85 PathProgramCache]: Analyzing trace with hash 444674194, now seen corresponding path program 1 times [2022-07-12 18:09:47,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:09:47,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158313965] [2022-07-12 18:09:47,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:47,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:09:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:47,511 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-12 18:09:47,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:09:47,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158313965] [2022-07-12 18:09:47,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158313965] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:09:47,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721446986] [2022-07-12 18:09:47,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:47,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:09:47,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:09:47,513 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-12 18:09:47,515 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-12 18:09:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:47,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 18:09:47,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:09:47,624 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-12 18:09:47,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:09:47,665 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-12 18:09:47,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721446986] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:09:47,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:09:47,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-12 18:09:47,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727060834] [2022-07-12 18:09:47,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:09:47,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 18:09:47,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:09:47,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 18:09:47,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:09:47,667 INFO L87 Difference]: Start difference. First operand 247 states and 298 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:09:47,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:47,721 INFO L93 Difference]: Finished difference Result 263 states and 306 transitions. [2022-07-12 18:09:47,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:09:47,722 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-12 18:09:47,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:47,723 INFO L225 Difference]: With dead ends: 263 [2022-07-12 18:09:47,723 INFO L226 Difference]: Without dead ends: 263 [2022-07-12 18:09:47,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-07-12 18:09:47,724 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 197 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:47,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 899 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:09:47,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-07-12 18:09:47,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 255. [2022-07-12 18:09:47,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 212 states have (on average 1.3679245283018868) internal successors, (290), 246 states have internal predecessors, (290), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-12 18:09:47,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 306 transitions. [2022-07-12 18:09:47,731 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 306 transitions. Word has length 36 [2022-07-12 18:09:47,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:47,731 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 306 transitions. [2022-07-12 18:09:47,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:09:47,731 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 306 transitions. [2022-07-12 18:09:47,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 18:09:47,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:47,732 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 18:09:47,766 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-12 18:09:47,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:09:47,951 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting sll_appendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-12 18:09:47,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:47,952 INFO L85 PathProgramCache]: Analyzing trace with hash -308582730, now seen corresponding path program 1 times [2022-07-12 18:09:47,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:09:47,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159800366] [2022-07-12 18:09:47,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:47,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:09:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:48,015 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:48,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:09:48,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159800366] [2022-07-12 18:09:48,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159800366] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:09:48,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360345775] [2022-07-12 18:09:48,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:48,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:09:48,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:09:48,017 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-12 18:09:48,018 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-12 18:09:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:48,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 18:09:48,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:09:48,134 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:48,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:09:48,159 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:48,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360345775] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:09:48,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:09:48,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2022-07-12 18:09:48,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463617863] [2022-07-12 18:09:48,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:09:48,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:09:48,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:09:48,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:09:48,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:09:48,161 INFO L87 Difference]: Start difference. First operand 255 states and 306 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 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-12 18:09:48,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:48,259 INFO L93 Difference]: Finished difference Result 369 states and 428 transitions. [2022-07-12 18:09:48,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 18:09:48,260 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 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 40 [2022-07-12 18:09:48,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:48,262 INFO L225 Difference]: With dead ends: 369 [2022-07-12 18:09:48,262 INFO L226 Difference]: Without dead ends: 369 [2022-07-12 18:09:48,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2022-07-12 18:09:48,263 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 162 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:48,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1150 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:09:48,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-07-12 18:09:48,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 318. [2022-07-12 18:09:48,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 274 states have (on average 1.3722627737226278) internal successors, (376), 308 states have internal predecessors, (376), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-12 18:09:48,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 390 transitions. [2022-07-12 18:09:48,269 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 390 transitions. Word has length 40 [2022-07-12 18:09:48,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:48,270 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 390 transitions. [2022-07-12 18:09:48,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 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-12 18:09:48,270 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 390 transitions. [2022-07-12 18:09:48,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 18:09:48,270 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:48,270 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:48,289 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-12 18:09:48,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-12 18:09:48,488 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting sll_appendErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-12 18:09:48,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:48,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1726785188, now seen corresponding path program 2 times [2022-07-12 18:09:48,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:09:48,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634843405] [2022-07-12 18:09:48,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:48,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:09:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:48,595 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-12 18:09:48,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:09:48,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634843405] [2022-07-12 18:09:48,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634843405] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:09:48,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801607200] [2022-07-12 18:09:48,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:09:48,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:09:48,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:09:48,597 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-12 18:09:48,651 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-12 18:09:48,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:09:48,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:09:48,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-12 18:09:48,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:09:48,734 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-12 18:09:48,765 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:09:48,765 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 18 [2022-07-12 18:09:48,778 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:09:48,779 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 16 treesize of output 22 [2022-07-12 18:09:48,833 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-07-12 18:09:48,833 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 3 case distinctions, treesize of input 22 treesize of output 43 [2022-07-12 18:09:48,897 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-07-12 18:09:48,898 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 3 case distinctions, treesize of input 22 treesize of output 43 [2022-07-12 18:09:48,986 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 18:09:48,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:09:48,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801607200] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:09:48,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 18:09:48,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 12 [2022-07-12 18:09:48,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234036219] [2022-07-12 18:09:48,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:09:48,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:09:48,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:09:48,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:09:48,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:09:48,988 INFO L87 Difference]: Start difference. First operand 318 states and 390 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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-12 18:09:49,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:49,063 INFO L93 Difference]: Finished difference Result 342 states and 414 transitions. [2022-07-12 18:09:49,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:09:49,063 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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 44 [2022-07-12 18:09:49,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:49,064 INFO L225 Difference]: With dead ends: 342 [2022-07-12 18:09:49,064 INFO L226 Difference]: Without dead ends: 342 [2022-07-12 18:09:49,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:09:49,065 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 164 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:49,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 328 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 122 Invalid, 0 Unknown, 78 Unchecked, 0.1s Time] [2022-07-12 18:09:49,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-07-12 18:09:49,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 315. [2022-07-12 18:09:49,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 274 states have (on average 1.354014598540146) internal successors, (371), 305 states have internal predecessors, (371), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-12 18:09:49,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 385 transitions. [2022-07-12 18:09:49,070 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 385 transitions. Word has length 44 [2022-07-12 18:09:49,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:49,070 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 385 transitions. [2022-07-12 18:09:49,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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-12 18:09:49,071 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 385 transitions. [2022-07-12 18:09:49,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 18:09:49,071 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:49,071 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:49,090 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-12 18:09:49,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-12 18:09:49,287 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting sll_appendErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-12 18:09:49,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:49,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1726785189, now seen corresponding path program 1 times [2022-07-12 18:09:49,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:09:49,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703957237] [2022-07-12 18:09:49,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:49,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:09:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:49,391 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 18:09:49,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:09:49,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703957237] [2022-07-12 18:09:49,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703957237] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:09:49,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702810559] [2022-07-12 18:09:49,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:49,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:09:49,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:09:49,394 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-12 18:09:49,395 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-12 18:09:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:49,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 18:09:49,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:09:49,503 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-12 18:09:49,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:49,594 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-12 18:09:49,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:49,615 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-12 18:09:49,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:49,637 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-12 18:09:49,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:49,659 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-12 18:09:49,695 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 18:09:49,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:09:54,297 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 18:09:54,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702810559] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:09:54,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:09:54,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-07-12 18:09:54,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257923870] [2022-07-12 18:09:54,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:09:54,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 18:09:54,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:09:54,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 18:09:54,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:09:54,301 INFO L87 Difference]: Start difference. First operand 315 states and 385 transitions. Second operand has 14 states, 13 states have (on average 6.538461538461538) internal successors, (85), 11 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:09:54,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:54,418 INFO L93 Difference]: Finished difference Result 339 states and 409 transitions. [2022-07-12 18:09:54,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:09:54,419 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.538461538461538) internal successors, (85), 11 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-12 18:09:54,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:54,420 INFO L225 Difference]: With dead ends: 339 [2022-07-12 18:09:54,420 INFO L226 Difference]: Without dead ends: 339 [2022-07-12 18:09:54,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-07-12 18:09:54,420 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 176 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:54,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 357 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 190 Invalid, 0 Unknown, 112 Unchecked, 0.1s Time] [2022-07-12 18:09:54,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-07-12 18:09:54,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 256. [2022-07-12 18:09:54,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 221 states have (on average 1.3529411764705883) internal successors, (299), 247 states have internal predecessors, (299), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-12 18:09:54,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 309 transitions. [2022-07-12 18:09:54,425 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 309 transitions. Word has length 44 [2022-07-12 18:09:54,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:54,425 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 309 transitions. [2022-07-12 18:09:54,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.538461538461538) internal successors, (85), 11 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:09:54,425 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 309 transitions. [2022-07-12 18:09:54,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 18:09:54,426 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:54,426 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2022-07-12 18:09:54,444 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-12 18:09:54,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:09:54,627 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting sll_appendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-12 18:09:54,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:54,627 INFO L85 PathProgramCache]: Analyzing trace with hash 685803597, now seen corresponding path program 2 times [2022-07-12 18:09:54,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:09:54,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324181380] [2022-07-12 18:09:54,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:54,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:09:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:54,888 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 18:09:54,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:09:54,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324181380] [2022-07-12 18:09:54,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324181380] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:09:54,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626388046] [2022-07-12 18:09:54,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:09:54,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:09:54,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:09:54,890 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-12 18:09:54,891 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-12 18:09:54,996 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:09:54,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:09:54,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-12 18:09:55,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:09:55,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:55,179 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-12 18:09:55,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:55,183 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-12 18:09:55,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:55,221 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-12 18:09:55,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:55,224 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-12 18:09:55,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:55,268 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-12 18:09:55,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:55,273 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-12 18:09:55,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:55,330 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-12 18:09:55,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:55,335 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-12 18:09:55,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:55,388 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-12 18:09:55,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:55,394 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-12 18:09:55,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:55,407 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-12 18:09:55,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:55,411 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-12 18:09:55,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:55,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 18:09:55,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:55,476 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-12 18:09:55,517 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-12 18:09:55,519 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-12 18:09:55,526 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 18:09:55,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:09:55,537 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1018 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_~new_last~0#1.base| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1017 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_~new_last~0#1.base| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-07-12 18:09:55,546 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_~new_last~0#1.base_13| Int)) (or (forall ((v_ArrVal_1017 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (<= |v_sll_append_~new_last~0#1.base_13| |c_sll_append_node_create_with_sublist_#res#1.base|)))) (forall ((|v_sll_append_~new_last~0#1.base_13| Int)) (or (forall ((v_ArrVal_1018 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (<= |v_sll_append_~new_last~0#1.base_13| |c_sll_append_node_create_with_sublist_#res#1.base|))))) is different from false [2022-07-12 18:09:55,558 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1018 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store |c_#memory_$Pointer$.base| |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (forall ((v_ArrVal_1017 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (= (select (select (store |c_#memory_$Pointer$.offset| |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) is different from false [2022-07-12 18:09:55,568 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|)))) is different from false [2022-07-12 18:09:55,638 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|)))) is different from false [2022-07-12 18:09:55,666 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_40| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= 0 (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|)) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_40| Int)) (or (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|))))) is different from false [2022-07-12 18:09:55,716 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1009 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_40| Int)) (or (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_40| Int) (v_ArrVal_1010 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))))) is different from false [2022-07-12 18:09:55,768 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1009 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_40| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_40| Int) (v_ArrVal_1010 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|))))) is different from false [2022-07-12 18:09:55,820 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1008 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_40| Int) (v_ArrVal_1010 (Array Int Int))) (or (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_1007 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1009 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_40| Int)) (or (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|))))))) is different from false [2022-07-12 18:09:55,884 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1007 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1009 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_40| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))))))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int)) (or (forall ((v_ArrVal_1008 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_40| Int) (v_ArrVal_1010 (Array Int Int))) (or (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|))))) is different from false [2022-07-12 18:09:55,985 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (v_ArrVal_1005 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1007 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((v_ArrVal_1009 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_40| Int)) (or (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (v_ArrVal_1006 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1008 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_40| Int) (v_ArrVal_1010 (Array Int Int))) (or (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|))))))) is different from false [2022-07-12 18:09:56,598 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (v_ArrVal_1006 (Array Int Int))) (or (forall ((v_ArrVal_1008 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_40| Int) (v_ArrVal_1010 (Array Int Int))) (or (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (v_ArrVal_1005 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1007 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1009 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_40| Int)) (or (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|))))))))))) is different from false [2022-07-12 18:09:58,752 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (v_ArrVal_1005 (Array Int Int))) (or (forall ((v_ArrVal_1007 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((v_ArrVal_1009 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_40| Int)) (or (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |v_sll_append_~new_last~0#1.base_13|) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1011) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)))))) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (v_ArrVal_1006 (Array Int Int))) (or (forall ((v_ArrVal_1008 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_40| Int) (v_ArrVal_1010 (Array Int Int))) (or (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |v_sll_append_~new_last~0#1.base_13|) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1012) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|))))))))) is different from false [2022-07-12 18:10:00,833 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (v_ArrVal_1006 (Array Int Int))) (or (forall ((v_ArrVal_1008 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_40| Int) (v_ArrVal_1010 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1012) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |v_sll_append_~new_last~0#1.base_13|))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)))))))) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (v_ArrVal_1005 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1007 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((v_ArrVal_1009 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_40| Int)) (or (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1011) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|))))))))))) is different from false [2022-07-12 18:10:01,408 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 28 not checked. [2022-07-12 18:10:01,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626388046] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:10:01,408 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:10:01,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 19] total 36 [2022-07-12 18:10:01,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193582798] [2022-07-12 18:10:01,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:10:01,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-12 18:10:01,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:10:01,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-12 18:10:01,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=395, Unknown=14, NotChecked=742, Total=1260 [2022-07-12 18:10:01,410 INFO L87 Difference]: Start difference. First operand 256 states and 309 transitions. Second operand has 36 states, 36 states have (on average 2.638888888888889) internal successors, (95), 33 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:10:03,428 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (v_ArrVal_1006 (Array Int Int))) (or (forall ((v_ArrVal_1008 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_40| Int) (v_ArrVal_1010 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1012) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |v_sll_append_~new_last~0#1.base_13|))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)))))))) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (v_ArrVal_1005 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1007 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((v_ArrVal_1009 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_40| Int)) (or (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1011) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)))))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#head~1#1.base|)) is different from false [2022-07-12 18:10:05,434 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_sll_append_#in~head#1.offset| 0) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (v_ArrVal_1005 (Array Int Int))) (or (forall ((v_ArrVal_1007 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((v_ArrVal_1009 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_40| Int)) (or (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |v_sll_append_~new_last~0#1.base_13|) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1011) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)))))) (<= (+ |c_#StackHeapBarrier| 1) |c_sll_append_#in~head#1.base|) (< |c_#StackHeapBarrier| |c_sll_append_#in~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0) (= (select |c_#valid| |c_sll_append_#in~head#1.base|) 1) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (v_ArrVal_1006 (Array Int Int))) (or (forall ((v_ArrVal_1008 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_40| Int) (v_ArrVal_1010 (Array Int Int))) (or (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |v_sll_append_~new_last~0#1.base_13|) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1012) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) is different from false [2022-07-12 18:10:07,439 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (v_ArrVal_1006 (Array Int Int))) (or (forall ((v_ArrVal_1008 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_40| Int) (v_ArrVal_1010 (Array Int Int))) (or (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)))))) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (v_ArrVal_1005 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1007 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1009 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_40| Int)) (or (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)))))))))) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-12 18:10:09,502 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1007 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1009 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_40| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))))))))) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int)) (or (forall ((v_ArrVal_1008 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_40| Int) (v_ArrVal_1010 (Array Int Int))) (or (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-12 18:10:11,507 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1007 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1009 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_40| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))))))))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int)) (or (forall ((v_ArrVal_1008 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_40| Int) (v_ArrVal_1010 (Array Int Int))) (or (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-12 18:10:11,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:10:11,736 INFO L93 Difference]: Finished difference Result 308 states and 370 transitions. [2022-07-12 18:10:11,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 18:10:11,737 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.638888888888889) internal successors, (95), 33 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-12 18:10:11,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:10:11,738 INFO L225 Difference]: With dead ends: 308 [2022-07-12 18:10:11,738 INFO L226 Difference]: Without dead ends: 308 [2022-07-12 18:10:11,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=164, Invalid=543, Unknown=19, NotChecked=1254, Total=1980 [2022-07-12 18:10:11,739 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 28 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1862 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 541 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:10:11,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1862 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 294 Invalid, 0 Unknown, 541 Unchecked, 0.2s Time] [2022-07-12 18:10:11,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-07-12 18:10:11,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 303. [2022-07-12 18:10:11,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 265 states have (on average 1.3169811320754716) internal successors, (349), 293 states have internal predecessors, (349), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-12 18:10:11,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 365 transitions. [2022-07-12 18:10:11,744 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 365 transitions. Word has length 44 [2022-07-12 18:10:11,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:10:11,744 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 365 transitions. [2022-07-12 18:10:11,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.638888888888889) internal successors, (95), 33 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:10:11,744 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 365 transitions. [2022-07-12 18:10:11,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 18:10:11,745 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:10:11,745 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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-12 18:10:11,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 18:10:11,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:10:11,958 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting sll_appendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-12 18:10:11,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:10:11,958 INFO L85 PathProgramCache]: Analyzing trace with hash -686003701, now seen corresponding path program 1 times [2022-07-12 18:10:11,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:10:11,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911483698] [2022-07-12 18:10:11,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:10:11,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:10:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:10:11,976 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-12 18:10:11,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:10:11,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911483698] [2022-07-12 18:10:11,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911483698] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:10:11,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:10:11,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:10:11,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314093088] [2022-07-12 18:10:11,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:10:11,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:10:11,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:10:11,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:10:11,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:10:11,977 INFO L87 Difference]: Start difference. First operand 303 states and 365 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-12 18:10:11,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:10:11,989 INFO L93 Difference]: Finished difference Result 398 states and 486 transitions. [2022-07-12 18:10:11,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:10:11,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 44 [2022-07-12 18:10:11,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:10:11,991 INFO L225 Difference]: With dead ends: 398 [2022-07-12 18:10:11,991 INFO L226 Difference]: Without dead ends: 398 [2022-07-12 18:10:11,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:10:11,992 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 69 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:10:11,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 331 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:10:11,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-07-12 18:10:11,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 307. [2022-07-12 18:10:11,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 269 states have (on average 1.3011152416356877) internal successors, (350), 297 states have internal predecessors, (350), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-12 18:10:11,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 366 transitions. [2022-07-12 18:10:11,997 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 366 transitions. Word has length 44 [2022-07-12 18:10:11,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:10:11,997 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 366 transitions. [2022-07-12 18:10:11,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-12 18:10:11,997 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 366 transitions. [2022-07-12 18:10:11,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-12 18:10:11,998 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:10:11,998 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:10:11,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 18:10:11,998 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting sll_appendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-12 18:10:11,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:10:11,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1834257435, now seen corresponding path program 1 times [2022-07-12 18:10:11,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:10:11,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215920960] [2022-07-12 18:10:11,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:10:11,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:10:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:10:12,211 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 18:10:12,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:10:12,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215920960] [2022-07-12 18:10:12,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215920960] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:10:12,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919026292] [2022-07-12 18:10:12,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:10:12,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:10:12,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:10:12,213 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:10:12,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 18:10:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:10:12,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-12 18:10:12,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:10:12,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:12,540 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-12 18:10:12,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:12,544 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-12 18:10:12,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:12,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 14 treesize of output 16 [2022-07-12 18:10:12,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:12,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-12 18:10:12,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:12,763 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-12 18:10:12,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:12,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:12,775 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:10:12,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2022-07-12 18:10:12,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:12,829 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-12 18:10:12,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:12,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 18:10:12,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:12,844 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-12 18:10:12,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:12,848 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-12 18:10:12,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:12,897 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-12 18:10:12,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:12,901 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-12 18:10:12,922 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-12 18:10:12,923 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-12 18:10:12,928 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-12 18:10:12,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:10:12,947 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1176 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_~new_last~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_~new_last~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-07-12 18:10:12,955 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_#res#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1176 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_#res#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-07-12 18:10:12,960 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1176 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-07-12 18:10:12,984 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-07-12 18:10:12,995 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|))))) is different from false [2022-07-12 18:10:13,014 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1168 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|))))) is different from false [2022-07-12 18:10:13,042 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1168 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))))) is different from false [2022-07-12 18:10:13,058 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1168 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|))))))) is different from false [2022-07-12 18:10:13,085 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1165 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1165))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_1166 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (forall ((v_ArrVal_1168 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|))))) is different from false [2022-07-12 18:10:13,130 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (forall ((v_ArrVal_1166 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (forall ((v_ArrVal_1168 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1165 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1165))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))))))) is different from false [2022-07-12 18:10:13,208 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (forall ((v_ArrVal_1166 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1168 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1171) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1177) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (forall ((v_ArrVal_1165 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1165))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1170) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1176) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| |c_#StackHeapBarrier|))))) is different from false [2022-07-12 18:10:13,241 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1166 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1168 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1171) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1177) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))))))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (forall ((v_ArrVal_1165 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1165))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1170) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1176) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| |c_#StackHeapBarrier|))))) is different from false [2022-07-12 18:10:13,726 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 15 not checked. [2022-07-12 18:10:13,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919026292] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:10:13,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:10:13,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 17] total 38 [2022-07-12 18:10:13,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940345018] [2022-07-12 18:10:13,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:10:13,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-12 18:10:13,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:10:13,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-12 18:10:13,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=544, Unknown=12, NotChecked=708, Total=1406 [2022-07-12 18:10:13,728 INFO L87 Difference]: Start difference. First operand 307 states and 366 transitions. Second operand has 38 states, 38 states have (on average 2.5) internal successors, (95), 35 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:10:13,737 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1166 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1168 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1171) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1177) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))))))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| |c_#StackHeapBarrier|)))) (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (forall ((v_ArrVal_1165 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1165))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1170) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1176) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| |c_#StackHeapBarrier|)))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#head~1#1.base|)) is different from false [2022-07-12 18:10:13,755 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_sll_append_#in~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_sll_append_#in~head#1.base|))) (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (forall ((v_ArrVal_1166 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1168 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1171) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1177) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| |c_#StackHeapBarrier|)))) (= |c_sll_append_#in~head#1.offset| 0) (= (select .cse0 0) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_sll_append_#in~head#1.base|) (< |c_#StackHeapBarrier| |c_sll_append_#in~head#1.base|) (= (select .cse1 |c_sll_append_#in~head#1.offset|) 0) (= (select .cse1 0) 0) (= (select |c_#valid| |c_sll_append_#in~head#1.base|) 1) (= (select .cse0 |c_sll_append_#in~head#1.offset|) 0) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (forall ((v_ArrVal_1165 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1165))) (store .cse2 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse2 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1170) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1176) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| |c_#StackHeapBarrier|)))))) is different from false [2022-07-12 18:10:13,759 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (forall ((v_ArrVal_1166 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (forall ((v_ArrVal_1168 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1165 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1165))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))))))) is different from false [2022-07-12 18:10:13,763 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (forall ((v_ArrVal_1165 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1165))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((v_ArrVal_1166 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (forall ((v_ArrVal_1168 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)))) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-12 18:10:15,766 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1168 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))))) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-12 18:10:15,773 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1168 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-12 18:10:15,780 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((v_ArrVal_1168 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-12 18:10:15,787 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))) (exists ((|sll_append_sll_create_~new_head~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) 0) 0) (< |sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-12 18:10:16,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:10:16,117 INFO L93 Difference]: Finished difference Result 356 states and 418 transitions. [2022-07-12 18:10:16,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-12 18:10:16,119 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.5) internal successors, (95), 35 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-07-12 18:10:16,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:10:16,120 INFO L225 Difference]: With dead ends: 356 [2022-07-12 18:10:16,120 INFO L226 Difference]: Without dead ends: 356 [2022-07-12 18:10:16,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=222, Invalid=960, Unknown=20, NotChecked=1660, Total=2862 [2022-07-12 18:10:16,122 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 27 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1875 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 552 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:10:16,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1875 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 304 Invalid, 0 Unknown, 552 Unchecked, 0.1s Time] [2022-07-12 18:10:16,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-07-12 18:10:16,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 337. [2022-07-12 18:10:16,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 297 states have (on average 1.2760942760942762) internal successors, (379), 326 states have internal predecessors, (379), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 4 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-12 18:10:16,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 398 transitions. [2022-07-12 18:10:16,130 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 398 transitions. Word has length 47 [2022-07-12 18:10:16,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:10:16,130 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 398 transitions. [2022-07-12 18:10:16,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.5) internal successors, (95), 35 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:10:16,131 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 398 transitions. [2022-07-12 18:10:16,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-12 18:10:16,131 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:10:16,131 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-12 18:10:16,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-12 18:10:16,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-12 18:10:16,349 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-12 18:10:16,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:10:16,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1659810607, now seen corresponding path program 1 times [2022-07-12 18:10:16,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:10:16,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936057535] [2022-07-12 18:10:16,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:10:16,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:10:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:10:16,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 18:10:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:10:16,406 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 18:10:16,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:10:16,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936057535] [2022-07-12 18:10:16,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936057535] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:10:16,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:10:16,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:10:16,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812041952] [2022-07-12 18:10:16,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:10:16,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:10:16,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:10:16,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:10:16,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:10:16,408 INFO L87 Difference]: Start difference. First operand 337 states and 398 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:10:16,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:10:16,488 INFO L93 Difference]: Finished difference Result 393 states and 460 transitions. [2022-07-12 18:10:16,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:10:16,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-07-12 18:10:16,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:10:16,490 INFO L225 Difference]: With dead ends: 393 [2022-07-12 18:10:16,490 INFO L226 Difference]: Without dead ends: 393 [2022-07-12 18:10:16,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-12 18:10:16,490 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 192 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:10:16,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 284 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:10:16,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2022-07-12 18:10:16,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 337. [2022-07-12 18:10:16,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 297 states have (on average 1.2760942760942762) internal successors, (379), 326 states have internal predecessors, (379), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 4 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-12 18:10:16,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 398 transitions. [2022-07-12 18:10:16,495 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 398 transitions. Word has length 54 [2022-07-12 18:10:16,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:10:16,495 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 398 transitions. [2022-07-12 18:10:16,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:10:16,495 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 398 transitions. [2022-07-12 18:10:16,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 18:10:16,496 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:10:16,496 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1] [2022-07-12 18:10:16,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 18:10:16,496 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-12 18:10:16,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:10:16,496 INFO L85 PathProgramCache]: Analyzing trace with hash -85479915, now seen corresponding path program 1 times [2022-07-12 18:10:16,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:10:16,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261211572] [2022-07-12 18:10:16,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:10:16,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:10:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:10:16,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 18:10:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:10:16,612 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 18:10:16,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:10:16,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261211572] [2022-07-12 18:10:16,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261211572] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:10:16,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:10:16,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 18:10:16,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348755619] [2022-07-12 18:10:16,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:10:16,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 18:10:16,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:10:16,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 18:10:16,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:10:16,614 INFO L87 Difference]: Start difference. First operand 337 states and 398 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:10:16,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:10:16,920 INFO L93 Difference]: Finished difference Result 547 states and 660 transitions. [2022-07-12 18:10:16,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:10:16,920 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-07-12 18:10:16,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:10:16,922 INFO L225 Difference]: With dead ends: 547 [2022-07-12 18:10:16,922 INFO L226 Difference]: Without dead ends: 547 [2022-07-12 18:10:16,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-07-12 18:10:16,922 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 281 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:10:16,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 640 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:10:16,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-07-12 18:10:16,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 350. [2022-07-12 18:10:16,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 311 states have (on average 1.2861736334405145) internal successors, (400), 338 states have internal predecessors, (400), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 5 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-12 18:10:16,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 419 transitions. [2022-07-12 18:10:16,929 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 419 transitions. Word has length 55 [2022-07-12 18:10:16,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:10:16,929 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 419 transitions. [2022-07-12 18:10:16,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:10:16,929 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 419 transitions. [2022-07-12 18:10:16,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 18:10:16,930 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:10:16,930 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1] [2022-07-12 18:10:16,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-12 18:10:16,930 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-12 18:10:16,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:10:16,931 INFO L85 PathProgramCache]: Analyzing trace with hash -85479914, now seen corresponding path program 1 times [2022-07-12 18:10:16,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:10:16,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083729942] [2022-07-12 18:10:16,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:10:16,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:10:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:10:16,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 18:10:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:10:17,076 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 18:10:17,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:10:17,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083729942] [2022-07-12 18:10:17,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083729942] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:10:17,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:10:17,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 18:10:17,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652647183] [2022-07-12 18:10:17,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:10:17,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 18:10:17,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:10:17,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 18:10:17,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:10:17,078 INFO L87 Difference]: Start difference. First operand 350 states and 419 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:10:17,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:10:17,392 INFO L93 Difference]: Finished difference Result 556 states and 686 transitions. [2022-07-12 18:10:17,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:10:17,393 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-07-12 18:10:17,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:10:17,394 INFO L225 Difference]: With dead ends: 556 [2022-07-12 18:10:17,394 INFO L226 Difference]: Without dead ends: 556 [2022-07-12 18:10:17,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-07-12 18:10:17,395 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 273 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:10:17,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 656 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:10:17,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-07-12 18:10:17,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 386. [2022-07-12 18:10:17,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 347 states have (on average 1.3112391930835734) internal successors, (455), 374 states have internal predecessors, (455), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 5 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-12 18:10:17,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 474 transitions. [2022-07-12 18:10:17,405 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 474 transitions. Word has length 55 [2022-07-12 18:10:17,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:10:17,405 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 474 transitions. [2022-07-12 18:10:17,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:10:17,406 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 474 transitions. [2022-07-12 18:10:17,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-12 18:10:17,409 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:10:17,410 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1] [2022-07-12 18:10:17,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-12 18:10:17,410 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-12 18:10:17,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:10:17,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1645084350, now seen corresponding path program 1 times [2022-07-12 18:10:17,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:10:17,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861240391] [2022-07-12 18:10:17,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:10:17,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:10:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:10:17,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 18:10:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:10:17,488 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 18:10:17,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:10:17,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861240391] [2022-07-12 18:10:17,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861240391] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:10:17,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:10:17,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:10:17,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373830048] [2022-07-12 18:10:17,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:10:17,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:10:17,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:10:17,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:10:17,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:10:17,490 INFO L87 Difference]: Start difference. First operand 386 states and 474 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:10:17,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:10:17,636 INFO L93 Difference]: Finished difference Result 441 states and 545 transitions. [2022-07-12 18:10:17,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:10:17,636 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-07-12 18:10:17,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:10:17,637 INFO L225 Difference]: With dead ends: 441 [2022-07-12 18:10:17,637 INFO L226 Difference]: Without dead ends: 441 [2022-07-12 18:10:17,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:10:17,638 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 48 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:10:17,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 597 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:10:17,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2022-07-12 18:10:17,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 421. [2022-07-12 18:10:17,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 382 states have (on average 1.3350785340314135) internal successors, (510), 409 states have internal predecessors, (510), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 5 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-12 18:10:17,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 529 transitions. [2022-07-12 18:10:17,643 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 529 transitions. Word has length 56 [2022-07-12 18:10:17,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:10:17,643 INFO L495 AbstractCegarLoop]: Abstraction has 421 states and 529 transitions. [2022-07-12 18:10:17,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:10:17,643 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 529 transitions. [2022-07-12 18:10:17,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-12 18:10:17,644 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:10:17,644 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2022-07-12 18:10:17,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-12 18:10:17,644 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-12 18:10:17,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:10:17,644 INFO L85 PathProgramCache]: Analyzing trace with hash -541993187, now seen corresponding path program 1 times [2022-07-12 18:10:17,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:10:17,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975693246] [2022-07-12 18:10:17,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:10:17,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:10:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:10:17,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 18:10:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:10:17,748 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 18:10:17,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:10:17,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975693246] [2022-07-12 18:10:17,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975693246] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:10:17,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:10:17,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 18:10:17,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196220886] [2022-07-12 18:10:17,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:10:17,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:10:17,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:10:17,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:10:17,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:10:17,749 INFO L87 Difference]: Start difference. First operand 421 states and 529 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:10:17,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:10:17,967 INFO L93 Difference]: Finished difference Result 560 states and 704 transitions. [2022-07-12 18:10:17,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 18:10:17,967 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2022-07-12 18:10:17,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:10:17,969 INFO L225 Difference]: With dead ends: 560 [2022-07-12 18:10:17,969 INFO L226 Difference]: Without dead ends: 560 [2022-07-12 18:10:17,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-07-12 18:10:17,969 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 179 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:10:17,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 763 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:10:17,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2022-07-12 18:10:17,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 421. [2022-07-12 18:10:17,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 382 states have (on average 1.3219895287958114) internal successors, (505), 409 states have internal predecessors, (505), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 5 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-12 18:10:17,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 524 transitions. [2022-07-12 18:10:17,982 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 524 transitions. Word has length 57 [2022-07-12 18:10:17,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:10:17,982 INFO L495 AbstractCegarLoop]: Abstraction has 421 states and 524 transitions. [2022-07-12 18:10:17,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:10:17,982 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 524 transitions. [2022-07-12 18:10:17,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 18:10:17,983 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:10:17,983 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2022-07-12 18:10:17,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-12 18:10:17,984 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-12 18:10:17,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:10:17,984 INFO L85 PathProgramCache]: Analyzing trace with hash 383583177, now seen corresponding path program 1 times [2022-07-12 18:10:17,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:10:17,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871428026] [2022-07-12 18:10:17,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:10:17,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:10:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:10:18,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 18:10:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:10:18,343 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-12 18:10:18,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:10:18,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871428026] [2022-07-12 18:10:18,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871428026] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:10:18,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:10:18,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-07-12 18:10:18,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191286962] [2022-07-12 18:10:18,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:10:18,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 18:10:18,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:10:18,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 18:10:18,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:10:18,345 INFO L87 Difference]: Start difference. First operand 421 states and 524 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:10:19,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:10:19,234 INFO L93 Difference]: Finished difference Result 703 states and 878 transitions. [2022-07-12 18:10:19,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 18:10:19,234 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-07-12 18:10:19,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:10:19,236 INFO L225 Difference]: With dead ends: 703 [2022-07-12 18:10:19,236 INFO L226 Difference]: Without dead ends: 703 [2022-07-12 18:10:19,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=205, Invalid=1277, Unknown=0, NotChecked=0, Total=1482 [2022-07-12 18:10:19,237 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 592 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:10:19,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 1086 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 18:10:19,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2022-07-12 18:10:19,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 458. [2022-07-12 18:10:19,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 419 states have (on average 1.331742243436754) internal successors, (558), 445 states have internal predecessors, (558), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 6 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-12 18:10:19,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 577 transitions. [2022-07-12 18:10:19,244 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 577 transitions. Word has length 58 [2022-07-12 18:10:19,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:10:19,244 INFO L495 AbstractCegarLoop]: Abstraction has 458 states and 577 transitions. [2022-07-12 18:10:19,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:10:19,244 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 577 transitions. [2022-07-12 18:10:19,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 18:10:19,245 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:10:19,245 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2022-07-12 18:10:19,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-12 18:10:19,245 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-12 18:10:19,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:10:19,245 INFO L85 PathProgramCache]: Analyzing trace with hash 383583178, now seen corresponding path program 1 times [2022-07-12 18:10:19,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:10:19,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007879902] [2022-07-12 18:10:19,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:10:19,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:10:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:10:19,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 18:10:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:10:19,620 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 18:10:19,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:10:19,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007879902] [2022-07-12 18:10:19,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007879902] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:10:19,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:10:19,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-12 18:10:19,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618362359] [2022-07-12 18:10:19,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:10:19,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 18:10:19,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:10:19,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 18:10:19,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2022-07-12 18:10:19,621 INFO L87 Difference]: Start difference. First operand 458 states and 577 transitions. Second operand has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:10:20,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:10:20,643 INFO L93 Difference]: Finished difference Result 760 states and 937 transitions. [2022-07-12 18:10:20,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-12 18:10:20,648 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-07-12 18:10:20,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:10:20,650 INFO L225 Difference]: With dead ends: 760 [2022-07-12 18:10:20,650 INFO L226 Difference]: Without dead ends: 760 [2022-07-12 18:10:20,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=199, Invalid=1207, Unknown=0, NotChecked=0, Total=1406 [2022-07-12 18:10:20,653 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 627 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:10:20,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 914 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 18:10:20,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2022-07-12 18:10:20,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 458. [2022-07-12 18:10:20,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 419 states have (on average 1.3269689737470167) internal successors, (556), 445 states have internal predecessors, (556), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 6 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-12 18:10:20,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 575 transitions. [2022-07-12 18:10:20,665 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 575 transitions. Word has length 58 [2022-07-12 18:10:20,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:10:20,665 INFO L495 AbstractCegarLoop]: Abstraction has 458 states and 575 transitions. [2022-07-12 18:10:20,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:10:20,665 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 575 transitions. [2022-07-12 18:10:20,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-12 18:10:20,666 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:10:20,666 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:10:20,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-12 18:10:20,666 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-12 18:10:20,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:10:20,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1581411742, now seen corresponding path program 1 times [2022-07-12 18:10:20,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:10:20,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552431846] [2022-07-12 18:10:20,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:10:20,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:10:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:10:20,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 18:10:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:10:21,535 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-12 18:10:21,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:10:21,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552431846] [2022-07-12 18:10:21,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552431846] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:10:21,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12210895] [2022-07-12 18:10:21,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:10:21,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:10:21,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:10:21,538 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:10:21,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-12 18:10:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:10:21,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 124 conjunts are in the unsatisfiable core [2022-07-12 18:10:21,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:10:21,703 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-12 18:10:21,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-07-12 18:10:22,009 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 18:10:22,010 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 18:10:22,068 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-12 18:10:22,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:10:22,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:22,307 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 30 [2022-07-12 18:10:22,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:22,312 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 27 treesize of output 26 [2022-07-12 18:10:22,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:22,401 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-12 18:10:22,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 51 [2022-07-12 18:10:22,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:22,413 INFO L356 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2022-07-12 18:10:22,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 46 [2022-07-12 18:10:22,729 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-12 18:10:22,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 72 [2022-07-12 18:10:22,739 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-12 18:10:22,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 96 [2022-07-12 18:10:23,275 INFO L356 Elim1Store]: treesize reduction 68, result has 50.7 percent of original size [2022-07-12 18:10:23,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 105 treesize of output 125 [2022-07-12 18:10:23,301 INFO L356 Elim1Store]: treesize reduction 72, result has 29.4 percent of original size [2022-07-12 18:10:23,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 150 treesize of output 163 [2022-07-12 18:10:23,740 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 18:10:23,743 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-12 18:10:25,596 INFO L356 Elim1Store]: treesize reduction 296, result has 36.9 percent of original size [2022-07-12 18:10:25,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 13 new quantified variables, introduced 45 case distinctions, treesize of input 303 treesize of output 316 [2022-07-12 18:10:25,836 INFO L356 Elim1Store]: treesize reduction 168, result has 54.0 percent of original size [2022-07-12 18:10:25,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 12 new quantified variables, introduced 45 case distinctions, treesize of input 323 treesize of output 453