/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 18:16:05,976 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 18:16:05,979 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 18:16:06,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 18:16:06,030 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 18:16:06,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 18:16:06,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 18:16:06,036 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 18:16:06,038 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 18:16:06,039 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 18:16:06,041 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 18:16:06,042 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 18:16:06,043 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 18:16:06,044 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 18:16:06,046 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 18:16:06,047 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 18:16:06,048 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 18:16:06,050 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 18:16:06,052 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 18:16:06,055 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 18:16:06,057 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 18:16:06,059 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 18:16:06,061 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 18:16:06,062 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 18:16:06,067 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 18:16:06,068 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 18:16:06,068 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 18:16:06,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 18:16:06,070 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 18:16:06,071 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 18:16:06,072 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 18:16:06,073 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 18:16:06,074 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 18:16:06,075 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 18:16:06,076 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 18:16:06,077 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 18:16:06,078 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 18:16:06,078 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 18:16:06,079 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 18:16:06,080 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 18:16:06,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 18:16:06,082 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-15 18:16:06,111 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 18:16:06,112 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 18:16:06,112 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 18:16:06,112 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 18:16:06,113 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 18:16:06,113 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 18:16:06,114 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 18:16:06,117 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 18:16:06,117 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 18:16:06,117 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 18:16:06,118 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 18:16:06,118 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 18:16:06,118 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 18:16:06,118 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 18:16:06,119 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 18:16:06,119 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 18:16:06,119 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 18:16:06,119 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 18:16:06,121 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 18:16:06,121 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 18:16:06,122 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 18:16:06,122 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 18:16:06,122 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 18:16:06,123 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 18:16:06,123 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 18:16:06,123 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 18:16:06,124 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 18:16:06,124 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 18:16:06,124 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 18:16:06,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 18:16:06,125 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 [2022-10-15 18:16:06,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 18:16:06,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 18:16:06,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 18:16:06,602 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 18:16:06,605 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 18:16:06,607 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-10-15 18:16:06,688 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e3c861a0/566b444ea3f24d39916aa442921a84c0/FLAG143819da4 [2022-10-15 18:16:07,362 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 18:16:07,362 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i [2022-10-15 18:16:07,380 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e3c861a0/566b444ea3f24d39916aa442921a84c0/FLAG143819da4 [2022-10-15 18:16:07,658 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e3c861a0/566b444ea3f24d39916aa442921a84c0 [2022-10-15 18:16:07,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 18:16:07,672 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 18:16:07,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 18:16:07,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 18:16:07,682 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 18:16:07,683 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:16:07" (1/1) ... [2022-10-15 18:16:07,686 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17ff82ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:07, skipping insertion in model container [2022-10-15 18:16:07,686 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:16:07" (1/1) ... [2022-10-15 18:16:07,695 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 18:16:07,769 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 18:16:08,202 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-10-15 18:16:08,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 18:16:08,216 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 18:16:08,267 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-10-15 18:16:08,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 18:16:08,309 INFO L208 MainTranslator]: Completed translation [2022-10-15 18:16:08,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:08 WrapperNode [2022-10-15 18:16:08,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 18:16:08,312 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 18:16:08,312 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 18:16:08,312 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 18:16:08,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:08" (1/1) ... [2022-10-15 18:16:08,338 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:08" (1/1) ... [2022-10-15 18:16:08,370 INFO L138 Inliner]: procedures = 129, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 186 [2022-10-15 18:16:08,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 18:16:08,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 18:16:08,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 18:16:08,374 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 18:16:08,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:08" (1/1) ... [2022-10-15 18:16:08,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:08" (1/1) ... [2022-10-15 18:16:08,396 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:08" (1/1) ... [2022-10-15 18:16:08,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:08" (1/1) ... [2022-10-15 18:16:08,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:08" (1/1) ... [2022-10-15 18:16:08,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:08" (1/1) ... [2022-10-15 18:16:08,433 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:08" (1/1) ... [2022-10-15 18:16:08,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:08" (1/1) ... [2022-10-15 18:16:08,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 18:16:08,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 18:16:08,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 18:16:08,445 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 18:16:08,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:08" (1/1) ... [2022-10-15 18:16:08,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 18:16:08,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 18:16:08,488 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-10-15 18:16:08,501 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-10-15 18:16:08,556 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-10-15 18:16:08,556 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-10-15 18:16:08,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 18:16:08,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 18:16:08,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 18:16:08,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-15 18:16:08,558 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2022-10-15 18:16:08,558 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2022-10-15 18:16:08,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-15 18:16:08,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 18:16:08,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-15 18:16:08,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 18:16:08,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 18:16:08,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 18:16:08,727 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 18:16:08,731 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 18:16:08,817 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-10-15 18:16:09,302 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 18:16:09,313 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 18:16:09,313 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-10-15 18:16:09,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:16:09 BoogieIcfgContainer [2022-10-15 18:16:09,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 18:16:09,321 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 18:16:09,323 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 18:16:09,327 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 18:16:09,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 06:16:07" (1/3) ... [2022-10-15 18:16:09,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17561e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:16:09, skipping insertion in model container [2022-10-15 18:16:09,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:16:08" (2/3) ... [2022-10-15 18:16:09,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17561e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:16:09, skipping insertion in model container [2022-10-15 18:16:09,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:16:09" (3/3) ... [2022-10-15 18:16:09,336 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-2.i [2022-10-15 18:16:09,360 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 18:16:09,360 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2022-10-15 18:16:09,444 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 18:16:09,455 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7e520af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 18:16:09,457 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2022-10-15 18:16:09,463 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-10-15 18:16:09,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 18:16:09,474 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:16:09,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:16:09,477 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-10-15 18:16:09,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:16:09,485 INFO L85 PathProgramCache]: Analyzing trace with hash -46006015, now seen corresponding path program 1 times [2022-10-15 18:16:09,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:16:09,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355163821] [2022-10-15 18:16:09,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:16:09,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:16:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:16:09,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:16:09,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:16:09,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355163821] [2022-10-15 18:16:09,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355163821] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:16:09,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:16:09,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 18:16:09,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809392463] [2022-10-15 18:16:09,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:16:09,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 18:16:09,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:16:09,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 18:16:09,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 18:16:09,918 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-10-15 18:16:09,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:16:09,986 INFO L93 Difference]: Finished difference Result 128 states and 147 transitions. [2022-10-15 18:16:09,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 18:16:09,989 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-10-15 18:16:09,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:16:09,999 INFO L225 Difference]: With dead ends: 128 [2022-10-15 18:16:10,000 INFO L226 Difference]: Without dead ends: 122 [2022-10-15 18:16:10,002 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-10-15 18:16:10,006 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-10-15 18:16:10,008 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-10-15 18:16:10,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-10-15 18:16:10,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 116. [2022-10-15 18:16:10,059 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-10-15 18:16:10,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 130 transitions. [2022-10-15 18:16:10,064 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 130 transitions. Word has length 10 [2022-10-15 18:16:10,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:16:10,064 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 130 transitions. [2022-10-15 18:16:10,065 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-10-15 18:16:10,065 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 130 transitions. [2022-10-15 18:16:10,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 18:16:10,066 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:16:10,066 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:16:10,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 18:16:10,067 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-10-15 18:16:10,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:16:10,067 INFO L85 PathProgramCache]: Analyzing trace with hash 244152622, now seen corresponding path program 1 times [2022-10-15 18:16:10,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:16:10,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238581491] [2022-10-15 18:16:10,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:16:10,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:16:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:16:10,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:16:10,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:16:10,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238581491] [2022-10-15 18:16:10,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238581491] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:16:10,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:16:10,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 18:16:10,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738996432] [2022-10-15 18:16:10,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:16:10,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 18:16:10,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:16:10,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 18:16:10,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 18:16:10,311 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-10-15 18:16:10,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:16:10,485 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2022-10-15 18:16:10,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 18:16:10,486 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-10-15 18:16:10,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:16:10,490 INFO L225 Difference]: With dead ends: 151 [2022-10-15 18:16:10,490 INFO L226 Difference]: Without dead ends: 151 [2022-10-15 18:16:10,490 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-10-15 18:16:10,492 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-10-15 18:16:10,493 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-10-15 18:16:10,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-10-15 18:16:10,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 115. [2022-10-15 18:16:10,508 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-10-15 18:16:10,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2022-10-15 18:16:10,511 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 13 [2022-10-15 18:16:10,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:16:10,511 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2022-10-15 18:16:10,512 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-10-15 18:16:10,512 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2022-10-15 18:16:10,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 18:16:10,513 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:16:10,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:16:10,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 18:16:10,514 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-10-15 18:16:10,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:16:10,514 INFO L85 PathProgramCache]: Analyzing trace with hash 244152621, now seen corresponding path program 1 times [2022-10-15 18:16:10,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:16:10,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31803146] [2022-10-15 18:16:10,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:16:10,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:16:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:16:10,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:16:10,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:16:10,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31803146] [2022-10-15 18:16:10,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31803146] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:16:10,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:16:10,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 18:16:10,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667329808] [2022-10-15 18:16:10,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:16:10,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 18:16:10,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:16:10,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 18:16:10,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 18:16:10,622 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-10-15 18:16:10,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:16:10,769 INFO L93 Difference]: Finished difference Result 150 states and 168 transitions. [2022-10-15 18:16:10,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 18:16:10,769 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-10-15 18:16:10,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:16:10,774 INFO L225 Difference]: With dead ends: 150 [2022-10-15 18:16:10,775 INFO L226 Difference]: Without dead ends: 150 [2022-10-15 18:16:10,776 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-10-15 18:16:10,785 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 39 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-10-15 18:16:10,788 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-10-15 18:16:10,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-10-15 18:16:10,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 114. [2022-10-15 18:16:10,811 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-10-15 18:16:10,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2022-10-15 18:16:10,813 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 13 [2022-10-15 18:16:10,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:16:10,813 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2022-10-15 18:16:10,814 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-10-15 18:16:10,819 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2022-10-15 18:16:10,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 18:16:10,819 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:16:10,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:16:10,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 18:16:10,820 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-10-15 18:16:10,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:16:10,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1021253985, now seen corresponding path program 1 times [2022-10-15 18:16:10,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:16:10,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732584611] [2022-10-15 18:16:10,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:16:10,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:16:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:16:10,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:16:10,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:16:10,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732584611] [2022-10-15 18:16:10,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732584611] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:16:10,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:16:10,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 18:16:10,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488741315] [2022-10-15 18:16:10,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:16:10,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 18:16:10,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:16:10,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 18:16:10,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 18:16:10,936 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-10-15 18:16:11,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:16:11,030 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2022-10-15 18:16:11,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 18:16:11,031 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-10-15 18:16:11,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:16:11,032 INFO L225 Difference]: With dead ends: 112 [2022-10-15 18:16:11,033 INFO L226 Difference]: Without dead ends: 112 [2022-10-15 18:16:11,033 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-10-15 18:16:11,035 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 35 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-10-15 18:16:11,036 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.1s Time] [2022-10-15 18:16:11,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-10-15 18:16:11,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-10-15 18:16:11,043 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-10-15 18:16:11,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2022-10-15 18:16:11,044 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 14 [2022-10-15 18:16:11,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:16:11,045 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2022-10-15 18:16:11,045 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-10-15 18:16:11,046 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2022-10-15 18:16:11,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 18:16:11,046 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:16:11,047 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:16:11,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 18:16:11,047 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-10-15 18:16:11,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:16:11,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1021253984, now seen corresponding path program 1 times [2022-10-15 18:16:11,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:16:11,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291672186] [2022-10-15 18:16:11,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:16:11,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:16:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:16:11,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:16:11,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:16:11,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291672186] [2022-10-15 18:16:11,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291672186] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:16:11,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:16:11,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 18:16:11,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831982932] [2022-10-15 18:16:11,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:16:11,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 18:16:11,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:16:11,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 18:16:11,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 18:16:11,208 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-10-15 18:16:11,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:16:11,370 INFO L93 Difference]: Finished difference Result 213 states and 236 transitions. [2022-10-15 18:16:11,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 18:16:11,371 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-10-15 18:16:11,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:16:11,375 INFO L225 Difference]: With dead ends: 213 [2022-10-15 18:16:11,375 INFO L226 Difference]: Without dead ends: 213 [2022-10-15 18:16:11,376 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-10-15 18:16:11,379 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 160 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-10-15 18:16:11,380 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.1s Time] [2022-10-15 18:16:11,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-10-15 18:16:11,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 139. [2022-10-15 18:16:11,401 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-10-15 18:16:11,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 169 transitions. [2022-10-15 18:16:11,403 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 169 transitions. Word has length 14 [2022-10-15 18:16:11,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:16:11,405 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 169 transitions. [2022-10-15 18:16:11,406 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-10-15 18:16:11,407 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 169 transitions. [2022-10-15 18:16:11,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-15 18:16:11,408 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:16:11,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:16:11,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 18:16:11,409 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-10-15 18:16:11,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:16:11,412 INFO L85 PathProgramCache]: Analyzing trace with hash -790832604, now seen corresponding path program 1 times [2022-10-15 18:16:11,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:16:11,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038080257] [2022-10-15 18:16:11,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:16:11,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:16:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:16:11,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:16:11,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:16:11,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038080257] [2022-10-15 18:16:11,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038080257] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 18:16:11,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111641526] [2022-10-15 18:16:11,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:16:11,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 18:16:11,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 18:16:11,495 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-10-15 18:16:11,527 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-10-15 18:16:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:16:11,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 18:16:11,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 18:16:11,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:16:11,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 18:16:11,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:16:11,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111641526] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 18:16:11,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 18:16:11,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-10-15 18:16:11,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379462389] [2022-10-15 18:16:11,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 18:16:11,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 18:16:11,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:16:11,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 18:16:11,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-10-15 18:16:11,760 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-10-15 18:16:11,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:16:11,816 INFO L93 Difference]: Finished difference Result 192 states and 229 transitions. [2022-10-15 18:16:11,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 18:16:11,816 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-10-15 18:16:11,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:16:11,818 INFO L225 Difference]: With dead ends: 192 [2022-10-15 18:16:11,818 INFO L226 Difference]: Without dead ends: 192 [2022-10-15 18:16:11,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-10-15 18:16:11,819 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-10-15 18:16:11,820 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-10-15 18:16:11,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-10-15 18:16:11,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 156. [2022-10-15 18:16:11,827 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-10-15 18:16:11,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 193 transitions. [2022-10-15 18:16:11,829 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 193 transitions. Word has length 16 [2022-10-15 18:16:11,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:16:11,829 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 193 transitions. [2022-10-15 18:16:11,829 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-10-15 18:16:11,830 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 193 transitions. [2022-10-15 18:16:11,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-15 18:16:11,830 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:16:11,831 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:16:11,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-15 18:16:12,044 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-10-15 18:16:12,045 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-10-15 18:16:12,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:16:12,046 INFO L85 PathProgramCache]: Analyzing trace with hash -924446423, now seen corresponding path program 1 times [2022-10-15 18:16:12,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:16:12,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297723213] [2022-10-15 18:16:12,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:16:12,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:16:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:16:12,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:16:12,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:16:12,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297723213] [2022-10-15 18:16:12,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297723213] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 18:16:12,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647178566] [2022-10-15 18:16:12,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:16:12,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 18:16:12,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 18:16:12,184 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-10-15 18:16:12,188 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-10-15 18:16:12,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:16:12,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjunts are in the unsatisfiable core [2022-10-15 18:16:12,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 18:16:12,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:16:12,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 18:16:12,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:16:12,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647178566] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 18:16:12,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 18:16:12,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-10-15 18:16:12,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344668939] [2022-10-15 18:16:12,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 18:16:12,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-15 18:16:12,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:16:12,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-15 18:16:12,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-10-15 18:16:12,453 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-10-15 18:16:12,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:16:12,597 INFO L93 Difference]: Finished difference Result 238 states and 269 transitions. [2022-10-15 18:16:12,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 18:16:12,597 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-10-15 18:16:12,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:16:12,600 INFO L225 Difference]: With dead ends: 238 [2022-10-15 18:16:12,600 INFO L226 Difference]: Without dead ends: 238 [2022-10-15 18:16:12,600 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-10-15 18:16:12,602 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-10-15 18:16:12,606 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-10-15 18:16:12,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-10-15 18:16:12,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 164. [2022-10-15 18:16:12,614 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-10-15 18:16:12,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 201 transitions. [2022-10-15 18:16:12,618 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 201 transitions. Word has length 18 [2022-10-15 18:16:12,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:16:12,619 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 201 transitions. [2022-10-15 18:16:12,619 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-10-15 18:16:12,619 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 201 transitions. [2022-10-15 18:16:12,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-15 18:16:12,628 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:16:12,628 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:16:12,669 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-10-15 18:16:12,843 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-10-15 18:16:12,860 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-10-15 18:16:12,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:16:12,860 INFO L85 PathProgramCache]: Analyzing trace with hash 760370116, now seen corresponding path program 2 times [2022-10-15 18:16:12,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:16:12,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9019432] [2022-10-15 18:16:12,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:16:12,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:16:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:16:13,040 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-15 18:16:13,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:16:13,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9019432] [2022-10-15 18:16:13,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9019432] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:16:13,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:16:13,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 18:16:13,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037421909] [2022-10-15 18:16:13,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:16:13,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 18:16:13,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:16:13,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 18:16:13,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 18:16:13,046 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-10-15 18:16:13,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:16:13,089 INFO L93 Difference]: Finished difference Result 182 states and 205 transitions. [2022-10-15 18:16:13,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 18:16:13,090 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-10-15 18:16:13,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:16:13,091 INFO L225 Difference]: With dead ends: 182 [2022-10-15 18:16:13,092 INFO L226 Difference]: Without dead ends: 182 [2022-10-15 18:16:13,092 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-10-15 18:16:13,093 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-10-15 18:16:13,093 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-10-15 18:16:13,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-10-15 18:16:13,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2022-10-15 18:16:13,098 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-10-15 18:16:13,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 202 transitions. [2022-10-15 18:16:13,100 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 202 transitions. Word has length 26 [2022-10-15 18:16:13,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:16:13,100 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 202 transitions. [2022-10-15 18:16:13,100 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-10-15 18:16:13,101 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 202 transitions. [2022-10-15 18:16:13,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-15 18:16:13,101 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:16:13,102 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:16:13,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 18:16:13,102 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-10-15 18:16:13,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:16:13,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1087676229, now seen corresponding path program 2 times [2022-10-15 18:16:13,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:16:13,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810999237] [2022-10-15 18:16:13,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:16:13,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:16:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:16:13,702 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 18:16:13,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:16:13,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810999237] [2022-10-15 18:16:13,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810999237] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 18:16:13,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712064867] [2022-10-15 18:16:13,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 18:16:13,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 18:16:13,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 18:16:13,705 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-10-15 18:16:13,731 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-10-15 18:16:13,805 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 18:16:13,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 18:16:13,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 17 conjunts are in the unsatisfiable core [2022-10-15 18:16:13,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 18:16:13,857 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-10-15 18:16:13,864 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-10-15 18:16:13,932 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-15 18:16:13,933 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-10-15 18:16:13,943 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-10-15 18:16:13,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:13,982 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-10-15 18:16:13,989 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-15 18:16:13,990 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-10-15 18:16:14,024 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 18:16:14,025 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-10-15 18:16:14,079 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 18:16:14,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 18:16:14,695 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 18:16:14,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712064867] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 18:16:14,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 18:16:14,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 4] total 8 [2022-10-15 18:16:14,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031866200] [2022-10-15 18:16:14,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 18:16:14,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-15 18:16:14,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:16:14,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-15 18:16:14,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-10-15 18:16:14,699 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-10-15 18:16:14,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:16:14,759 INFO L93 Difference]: Finished difference Result 163 states and 198 transitions. [2022-10-15 18:16:14,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 18:16:14,759 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-10-15 18:16:14,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:16:14,761 INFO L225 Difference]: With dead ends: 163 [2022-10-15 18:16:14,761 INFO L226 Difference]: Without dead ends: 163 [2022-10-15 18:16:14,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-10-15 18:16:14,762 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-10-15 18:16:14,763 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-10-15 18:16:14,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-10-15 18:16:14,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2022-10-15 18:16:14,768 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-10-15 18:16:14,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 198 transitions. [2022-10-15 18:16:14,769 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 198 transitions. Word has length 26 [2022-10-15 18:16:14,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:16:14,770 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 198 transitions. [2022-10-15 18:16:14,770 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-10-15 18:16:14,770 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 198 transitions. [2022-10-15 18:16:14,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-10-15 18:16:14,771 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:16:14,771 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-10-15 18:16:14,812 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-10-15 18:16:14,986 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-10-15 18:16:14,987 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-10-15 18:16:14,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:16:14,988 INFO L85 PathProgramCache]: Analyzing trace with hash 320066679, now seen corresponding path program 1 times [2022-10-15 18:16:14,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:16:14,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277497133] [2022-10-15 18:16:14,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:16:14,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:16:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:16:15,104 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 18:16:15,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:16:15,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277497133] [2022-10-15 18:16:15,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277497133] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:16:15,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:16:15,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 18:16:15,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126962583] [2022-10-15 18:16:15,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:16:15,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 18:16:15,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:16:15,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 18:16:15,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 18:16:15,107 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-10-15 18:16:15,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:16:15,208 INFO L93 Difference]: Finished difference Result 162 states and 196 transitions. [2022-10-15 18:16:15,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 18:16:15,209 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-10-15 18:16:15,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:16:15,210 INFO L225 Difference]: With dead ends: 162 [2022-10-15 18:16:15,210 INFO L226 Difference]: Without dead ends: 162 [2022-10-15 18:16:15,211 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-10-15 18:16:15,211 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 83 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-10-15 18:16:15,212 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-10-15 18:16:15,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-10-15 18:16:15,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2022-10-15 18:16:15,216 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-10-15 18:16:15,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 196 transitions. [2022-10-15 18:16:15,218 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 196 transitions. Word has length 31 [2022-10-15 18:16:15,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:16:15,218 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 196 transitions. [2022-10-15 18:16:15,218 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-10-15 18:16:15,218 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 196 transitions. [2022-10-15 18:16:15,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-10-15 18:16:15,219 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:16:15,219 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-10-15 18:16:15,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 18:16:15,220 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-10-15 18:16:15,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:16:15,220 INFO L85 PathProgramCache]: Analyzing trace with hash 320066680, now seen corresponding path program 1 times [2022-10-15 18:16:15,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:16:15,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107204247] [2022-10-15 18:16:15,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:16:15,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:16:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:16:15,396 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 18:16:15,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:16:15,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107204247] [2022-10-15 18:16:15,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107204247] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:16:15,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:16:15,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 18:16:15,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941178857] [2022-10-15 18:16:15,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:16:15,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 18:16:15,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:16:15,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 18:16:15,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 18:16:15,399 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-10-15 18:16:15,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:16:15,506 INFO L93 Difference]: Finished difference Result 161 states and 194 transitions. [2022-10-15 18:16:15,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 18:16:15,507 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-10-15 18:16:15,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:16:15,508 INFO L225 Difference]: With dead ends: 161 [2022-10-15 18:16:15,508 INFO L226 Difference]: Without dead ends: 161 [2022-10-15 18:16:15,508 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-10-15 18:16:15,509 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 108 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-10-15 18:16:15,510 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.1s Time] [2022-10-15 18:16:15,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-10-15 18:16:15,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2022-10-15 18:16:15,514 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-10-15 18:16:15,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 194 transitions. [2022-10-15 18:16:15,515 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 194 transitions. Word has length 31 [2022-10-15 18:16:15,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:16:15,516 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 194 transitions. [2022-10-15 18:16:15,516 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-10-15 18:16:15,516 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 194 transitions. [2022-10-15 18:16:15,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-15 18:16:15,517 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:16:15,517 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-10-15 18:16:15,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 18:16:15,518 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-10-15 18:16:15,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:16:15,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1332132480, now seen corresponding path program 1 times [2022-10-15 18:16:15,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:16:15,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505140588] [2022-10-15 18:16:15,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:16:15,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:16:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:16:15,966 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 18:16:15,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:16:15,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505140588] [2022-10-15 18:16:15,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505140588] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 18:16:15,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404790430] [2022-10-15 18:16:15,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:16:15,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 18:16:15,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 18:16:15,969 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 18:16:15,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-15 18:16:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:16:16,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 26 conjunts are in the unsatisfiable core [2022-10-15 18:16:16,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 18:16:16,090 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-10-15 18:16:16,128 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 18:16:16,129 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-10-15 18:16:16,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:16,173 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-10-15 18:16:16,204 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 18:16:16,205 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-10-15 18:16:16,288 INFO L356 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-10-15 18:16:16,289 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-10-15 18:16:16,478 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-15 18:16:16,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 18:16:16,888 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-15 18:16:16,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404790430] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 18:16:16,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 18:16:16,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 17 [2022-10-15 18:16:16,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550201303] [2022-10-15 18:16:16,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 18:16:16,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-15 18:16:16,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:16:16,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-15 18:16:16,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-10-15 18:16:16,891 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-10-15 18:16:17,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:16:17,195 INFO L93 Difference]: Finished difference Result 222 states and 267 transitions. [2022-10-15 18:16:17,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 18:16:17,196 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-10-15 18:16:17,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:16:17,198 INFO L225 Difference]: With dead ends: 222 [2022-10-15 18:16:17,198 INFO L226 Difference]: Without dead ends: 222 [2022-10-15 18:16:17,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-10-15 18:16:17,199 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 283 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-10-15 18:16:17,199 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-10-15 18:16:17,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-10-15 18:16:17,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 213. [2022-10-15 18:16:17,206 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-10-15 18:16:17,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 265 transitions. [2022-10-15 18:16:17,208 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 265 transitions. Word has length 32 [2022-10-15 18:16:17,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:16:17,209 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 265 transitions. [2022-10-15 18:16:17,209 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-10-15 18:16:17,209 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 265 transitions. [2022-10-15 18:16:17,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-15 18:16:17,210 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:16:17,210 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-10-15 18:16:17,249 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-10-15 18:16:17,423 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-10-15 18:16:17,423 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-10-15 18:16:17,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:16:17,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1332132481, now seen corresponding path program 1 times [2022-10-15 18:16:17,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:16:17,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107358403] [2022-10-15 18:16:17,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:16:17,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:16:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:16:17,958 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 18:16:17,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:16:17,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107358403] [2022-10-15 18:16:17,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107358403] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 18:16:17,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353436797] [2022-10-15 18:16:17,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:16:17,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 18:16:17,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 18:16:17,962 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-10-15 18:16:17,982 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-10-15 18:16:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:16:18,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 24 conjunts are in the unsatisfiable core [2022-10-15 18:16:18,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 18:16:18,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 18:16:18,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:18,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-10-15 18:16:18,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:18,184 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-10-15 18:16:18,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:18,217 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-10-15 18:16:18,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:18,247 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-10-15 18:16:18,285 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 18:16:18,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 18:16:22,494 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_22| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_22| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_21| Int) (v_ArrVal_397 Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_21| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_398 Int)) (<= (+ |c_sll_append_~head#1.offset| 4) (select (store (store |c_#length| |v_sll_append_sll_create_~new_head~0#1.base_22| v_ArrVal_397) |v_sll_append_sll_create_~new_head~0#1.base_21| v_ArrVal_398) |c_sll_append_~head#1.base|))))))) (<= 0 |c_sll_append_~head#1.offset|)) is different from false [2022-10-15 18:16:24,638 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_23| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_23| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_22| Int) (v_ArrVal_396 Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_22| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_21| Int) (v_ArrVal_397 Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_21| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_398 Int)) (<= (+ |c_sll_append_~head#1.offset| 4) (select (store (store (store |c_#length| |v_sll_append_sll_create_~new_head~0#1.base_23| v_ArrVal_396) |v_sll_append_sll_create_~new_head~0#1.base_22| v_ArrVal_397) |v_sll_append_sll_create_~new_head~0#1.base_21| v_ArrVal_398) |c_sll_append_~head#1.base|))))))))) (<= 0 |c_sll_append_~head#1.offset|)) is different from false [2022-10-15 18:16:26,800 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_16| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_16| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_23| Int) (v_ArrVal_395 Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_23| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_22| Int) (v_ArrVal_396 Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_21| Int) (v_ArrVal_397 Int)) (or (forall ((v_ArrVal_398 Int)) (<= (+ |c_sll_append_#in~head#1.offset| 4) (select (store (store (store (store |c_#length| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_16| v_ArrVal_395) |v_sll_append_sll_create_~new_head~0#1.base_23| v_ArrVal_396) |v_sll_append_sll_create_~new_head~0#1.base_22| v_ArrVal_397) |v_sll_append_sll_create_~new_head~0#1.base_21| v_ArrVal_398) |c_sll_append_#in~head#1.base|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_21| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_22| |c_#StackHeapBarrier|)))))))) (<= 0 |c_sll_append_#in~head#1.offset|)) is different from false [2022-10-15 18:16:28,865 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_16| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_23| Int) (v_ArrVal_395 Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_23| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_22| Int) (v_ArrVal_396 Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_22| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_21| Int) (v_ArrVal_397 Int)) (or (forall ((v_ArrVal_398 Int)) (<= (+ 4 |c_ULTIMATE.start_main_~#head~1#1.offset|) (select (store (store (store (store |c_#length| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_16| v_ArrVal_395) |v_sll_append_sll_create_~new_head~0#1.base_23| v_ArrVal_396) |v_sll_append_sll_create_~new_head~0#1.base_22| v_ArrVal_397) |v_sll_append_sll_create_~new_head~0#1.base_21| v_ArrVal_398) |c_ULTIMATE.start_main_~#head~1#1.base|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_21| |c_#StackHeapBarrier|)))))))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_16| |c_#StackHeapBarrier|)))) (<= 0 |c_ULTIMATE.start_main_~#head~1#1.offset|)) is different from false [2022-10-15 18:16:29,111 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-10-15 18:16:29,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353436797] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 18:16:29,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 18:16:29,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 7] total 13 [2022-10-15 18:16:29,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547988599] [2022-10-15 18:16:29,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 18:16:29,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-15 18:16:29,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:16:29,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-15 18:16:29,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=70, Unknown=4, NotChecked=76, Total=182 [2022-10-15 18:16:29,114 INFO L87 Difference]: Start difference. First operand 213 states and 265 transitions. Second operand has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 11 states have internal predecessors, (63), 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-10-15 18:16:29,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:16:29,439 INFO L93 Difference]: Finished difference Result 234 states and 284 transitions. [2022-10-15 18:16:29,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 18:16:29,440 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 11 states have internal predecessors, (63), 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-10-15 18:16:29,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:16:29,442 INFO L225 Difference]: With dead ends: 234 [2022-10-15 18:16:29,442 INFO L226 Difference]: Without dead ends: 234 [2022-10-15 18:16:29,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=40, Invalid=82, Unknown=4, NotChecked=84, Total=210 [2022-10-15 18:16:29,444 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 210 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 557 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 18:16:29,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 247 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 214 Invalid, 0 Unknown, 557 Unchecked, 0.2s Time] [2022-10-15 18:16:29,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-10-15 18:16:29,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 207. [2022-10-15 18:16:29,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 170 states have (on average 1.4176470588235295) internal successors, (241), 199 states have internal predecessors, (241), 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-10-15 18:16:29,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 255 transitions. [2022-10-15 18:16:29,452 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 255 transitions. Word has length 32 [2022-10-15 18:16:29,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:16:29,453 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 255 transitions. [2022-10-15 18:16:29,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 11 states have internal predecessors, (63), 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-10-15 18:16:29,453 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 255 transitions. [2022-10-15 18:16:29,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-10-15 18:16:29,454 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:16:29,454 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-10-15 18:16:29,496 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-10-15 18:16:29,669 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-10-15 18:16:29,670 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-10-15 18:16:29,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:16:29,671 INFO L85 PathProgramCache]: Analyzing trace with hash 60922559, now seen corresponding path program 1 times [2022-10-15 18:16:29,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:16:29,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087435457] [2022-10-15 18:16:29,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:16:29,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:16:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:16:30,554 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 18:16:30,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:16:30,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087435457] [2022-10-15 18:16:30,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087435457] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 18:16:30,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461511233] [2022-10-15 18:16:30,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:16:30,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 18:16:30,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 18:16:30,557 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-10-15 18:16:30,583 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-10-15 18:16:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:16:30,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 64 conjunts are in the unsatisfiable core [2022-10-15 18:16:30,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 18:16:30,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:30,955 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-10-15 18:16:30,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:30,966 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-10-15 18:16:31,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:31,174 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-10-15 18:16:31,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:31,185 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-10-15 18:16:31,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:31,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 18:16:31,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:31,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:31,474 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-10-15 18:16:31,474 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-10-15 18:16:31,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:31,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:31,670 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 18:16:31,671 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-10-15 18:16:31,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:31,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 18:16:31,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:31,742 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-10-15 18:16:31,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:31,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-10-15 18:16:31,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:31,850 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-10-15 18:16:31,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:31,858 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-10-15 18:16:31,897 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-10-15 18:16:31,901 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-10-15 18:16:31,908 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:16:31,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 18:16:31,931 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-10-15 18:16:31,941 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-10-15 18:16:31,950 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-10-15 18:16:32,000 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-10-15 18:16:32,029 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-10-15 18:16:32,052 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-10-15 18:16:32,081 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-10-15 18:16:32,152 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-10-15 18:16:32,202 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-10-15 18:16:32,292 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-10-15 18:16:32,388 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-10-15 18:16:32,611 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-10-15 18:16:32,719 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-10-15 18:16:33,177 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-10-15 18:16:33,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461511233] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 18:16:33,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 18:16:33,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 18] total 41 [2022-10-15 18:16:33,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025510843] [2022-10-15 18:16:33,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 18:16:33,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-10-15 18:16:33,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:16:33,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-10-15 18:16:33,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=632, Unknown=13, NotChecked=832, Total=1640 [2022-10-15 18:16:33,180 INFO L87 Difference]: Start difference. First operand 207 states and 255 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-10-15 18:16:33,203 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-10-15 18:16:33,219 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-10-15 18:16:33,233 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-10-15 18:16:33,326 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-10-15 18:16:35,334 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-10-15 18:16:35,450 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-10-15 18:16:37,457 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-10-15 18:16:37,471 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-10-15 18:16:37,484 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-10-15 18:16:40,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:16:40,997 INFO L93 Difference]: Finished difference Result 259 states and 315 transitions. [2022-10-15 18:16:40,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-10-15 18:16:40,998 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-10-15 18:16:40,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:16:41,000 INFO L225 Difference]: With dead ends: 259 [2022-10-15 18:16:41,000 INFO L226 Difference]: Without dead ends: 259 [2022-10-15 18:16:41,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=243, Invalid=1083, Unknown=22, NotChecked=1958, Total=3306 [2022-10-15 18:16:41,003 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 26 mSDsluCounter, 1872 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1963 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 450 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 18:16:41,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 1963 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 297 Invalid, 0 Unknown, 450 Unchecked, 0.3s Time] [2022-10-15 18:16:41,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-10-15 18:16:41,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 238. [2022-10-15 18:16:41,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 199 states have (on average 1.3668341708542713) internal successors, (272), 229 states have internal predecessors, (272), 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-10-15 18:16:41,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 291 transitions. [2022-10-15 18:16:41,015 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 291 transitions. Word has length 35 [2022-10-15 18:16:41,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:16:41,015 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 291 transitions. [2022-10-15 18:16:41,016 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-10-15 18:16:41,016 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 291 transitions. [2022-10-15 18:16:41,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-10-15 18:16:41,017 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:16:41,017 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-10-15 18:16:41,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-10-15 18:16:41,231 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-10-15 18:16:41,232 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-10-15 18:16:41,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:16:41,233 INFO L85 PathProgramCache]: Analyzing trace with hash 762522433, now seen corresponding path program 1 times [2022-10-15 18:16:41,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:16:41,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118801543] [2022-10-15 18:16:41,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:16:41,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:16:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:16:41,281 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 18:16:41,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:16:41,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118801543] [2022-10-15 18:16:41,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118801543] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:16:41,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:16:41,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 18:16:41,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237680822] [2022-10-15 18:16:41,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:16:41,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 18:16:41,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:16:41,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 18:16:41,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 18:16:41,284 INFO L87 Difference]: Start difference. First operand 238 states and 291 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-10-15 18:16:41,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:16:41,294 INFO L93 Difference]: Finished difference Result 242 states and 292 transitions. [2022-10-15 18:16:41,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 18:16:41,295 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-10-15 18:16:41,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:16:41,296 INFO L225 Difference]: With dead ends: 242 [2022-10-15 18:16:41,297 INFO L226 Difference]: Without dead ends: 242 [2022-10-15 18:16:41,297 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-10-15 18:16:41,298 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 222 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-10-15 18:16:41,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 18:16:41,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-10-15 18:16:41,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2022-10-15 18:16:41,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 204 states have (on average 1.3529411764705883) internal successors, (276), 233 states have internal predecessors, (276), 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-10-15 18:16:41,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 292 transitions. [2022-10-15 18:16:41,306 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 292 transitions. Word has length 35 [2022-10-15 18:16:41,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:16:41,307 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 292 transitions. [2022-10-15 18:16:41,307 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-10-15 18:16:41,307 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 292 transitions. [2022-10-15 18:16:41,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-15 18:16:41,308 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:16:41,308 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-10-15 18:16:41,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-15 18:16:41,308 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-10-15 18:16:41,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:16:41,309 INFO L85 PathProgramCache]: Analyzing trace with hash 444674194, now seen corresponding path program 1 times [2022-10-15 18:16:41,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:16:41,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198019598] [2022-10-15 18:16:41,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:16:41,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:16:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:16:41,422 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-15 18:16:41,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:16:41,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198019598] [2022-10-15 18:16:41,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198019598] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 18:16:41,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822962958] [2022-10-15 18:16:41,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:16:41,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 18:16:41,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 18:16:41,424 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-10-15 18:16:41,445 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-10-15 18:16:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:16:41,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjunts are in the unsatisfiable core [2022-10-15 18:16:41,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 18:16:41,565 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-15 18:16:41,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 18:16:41,630 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-15 18:16:41,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822962958] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 18:16:41,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 18:16:41,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-10-15 18:16:41,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93904932] [2022-10-15 18:16:41,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 18:16:41,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-15 18:16:41,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:16:41,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-15 18:16:41,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-10-15 18:16:41,633 INFO L87 Difference]: Start difference. First operand 242 states and 292 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-10-15 18:16:41,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:16:41,723 INFO L93 Difference]: Finished difference Result 257 states and 300 transitions. [2022-10-15 18:16:41,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 18:16:41,724 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-10-15 18:16:41,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:16:41,726 INFO L225 Difference]: With dead ends: 257 [2022-10-15 18:16:41,726 INFO L226 Difference]: Without dead ends: 257 [2022-10-15 18:16:41,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 67 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-10-15 18:16:41,727 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 190 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 867 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-10-15 18:16:41,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 867 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 18:16:41,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-10-15 18:16:41,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 250. [2022-10-15 18:16:41,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 212 states have (on average 1.3396226415094339) internal successors, (284), 241 states have internal predecessors, (284), 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-10-15 18:16:41,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 300 transitions. [2022-10-15 18:16:41,736 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 300 transitions. Word has length 36 [2022-10-15 18:16:41,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:16:41,737 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 300 transitions. [2022-10-15 18:16:41,737 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-10-15 18:16:41,737 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 300 transitions. [2022-10-15 18:16:41,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-10-15 18:16:41,738 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:16:41,738 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-10-15 18:16:41,777 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-10-15 18:16:41,947 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-10-15 18:16:41,948 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-10-15 18:16:41,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:16:41,949 INFO L85 PathProgramCache]: Analyzing trace with hash -308582730, now seen corresponding path program 1 times [2022-10-15 18:16:41,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:16:41,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778037406] [2022-10-15 18:16:41,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:16:41,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:16:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:16:42,143 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:16:42,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:16:42,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778037406] [2022-10-15 18:16:42,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778037406] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 18:16:42,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239778998] [2022-10-15 18:16:42,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:16:42,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 18:16:42,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 18:16:42,146 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-10-15 18:16:42,166 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-10-15 18:16:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:16:42,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 13 conjunts are in the unsatisfiable core [2022-10-15 18:16:42,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 18:16:42,324 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:16:42,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 18:16:42,404 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 18:16:42,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239778998] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 18:16:42,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 18:16:42,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2022-10-15 18:16:42,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149825952] [2022-10-15 18:16:42,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 18:16:42,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-15 18:16:42,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:16:42,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-15 18:16:42,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-10-15 18:16:42,407 INFO L87 Difference]: Start difference. First operand 250 states and 300 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-10-15 18:16:42,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:16:42,574 INFO L93 Difference]: Finished difference Result 361 states and 419 transitions. [2022-10-15 18:16:42,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 18:16:42,574 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-10-15 18:16:42,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:16:42,577 INFO L225 Difference]: With dead ends: 361 [2022-10-15 18:16:42,577 INFO L226 Difference]: Without dead ends: 361 [2022-10-15 18:16:42,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 72 SyntacticMatches, 8 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2022-10-15 18:16:42,579 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 218 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 18:16:42,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1177 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 18:16:42,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-10-15 18:16:42,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 313. [2022-10-15 18:16:42,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 274 states have (on average 1.3467153284671534) internal successors, (369), 303 states have internal predecessors, (369), 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-10-15 18:16:42,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 383 transitions. [2022-10-15 18:16:42,591 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 383 transitions. Word has length 40 [2022-10-15 18:16:42,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:16:42,592 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 383 transitions. [2022-10-15 18:16:42,592 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-10-15 18:16:42,592 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 383 transitions. [2022-10-15 18:16:42,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-10-15 18:16:42,593 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:16:42,593 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-10-15 18:16:42,645 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-10-15 18:16:42,808 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-10-15 18:16:42,808 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-10-15 18:16:42,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:16:42,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1726785188, now seen corresponding path program 2 times [2022-10-15 18:16:42,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:16:42,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204383239] [2022-10-15 18:16:42,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:16:42,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:16:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:16:43,204 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-10-15 18:16:43,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:16:43,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204383239] [2022-10-15 18:16:43,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204383239] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 18:16:43,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657638133] [2022-10-15 18:16:43,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 18:16:43,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 18:16:43,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 18:16:43,207 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-10-15 18:16:43,212 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-10-15 18:16:43,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 18:16:43,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 18:16:43,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 26 conjunts are in the unsatisfiable core [2022-10-15 18:16:43,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 18:16:43,351 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-10-15 18:16:43,408 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 18:16:43,409 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-10-15 18:16:43,433 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 18:16:43,434 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-10-15 18:16:43,517 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-10-15 18:16:43,517 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-10-15 18:16:43,615 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-10-15 18:16:43,616 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-10-15 18:16:43,819 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-10-15 18:16:43,819 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 18:16:43,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657638133] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:16:43,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 18:16:43,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 12 [2022-10-15 18:16:43,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113917471] [2022-10-15 18:16:43,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:16:43,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-15 18:16:43,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:16:43,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-15 18:16:43,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-10-15 18:16:43,822 INFO L87 Difference]: Start difference. First operand 313 states and 383 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-10-15 18:16:44,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:16:44,046 INFO L93 Difference]: Finished difference Result 339 states and 409 transitions. [2022-10-15 18:16:44,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 18:16:44,047 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-10-15 18:16:44,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:16:44,049 INFO L225 Difference]: With dead ends: 339 [2022-10-15 18:16:44,049 INFO L226 Difference]: Without dead ends: 339 [2022-10-15 18:16:44,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-10-15 18:16:44,050 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 186 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 18:16:44,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 336 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 122 Invalid, 0 Unknown, 87 Unchecked, 0.1s Time] [2022-10-15 18:16:44,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-10-15 18:16:44,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 256. [2022-10-15 18:16:44,059 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-10-15 18:16:44,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 309 transitions. [2022-10-15 18:16:44,060 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 309 transitions. Word has length 44 [2022-10-15 18:16:44,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:16:44,061 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 309 transitions. [2022-10-15 18:16:44,061 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-10-15 18:16:44,061 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 309 transitions. [2022-10-15 18:16:44,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-10-15 18:16:44,062 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:16:44,062 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-10-15 18:16:44,107 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-10-15 18:16:44,276 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-10-15 18:16:44,277 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting sll_appendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-15 18:16:44,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:16:44,277 INFO L85 PathProgramCache]: Analyzing trace with hash 685803597, now seen corresponding path program 2 times [2022-10-15 18:16:44,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:16:44,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976947244] [2022-10-15 18:16:44,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:16:44,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:16:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:16:45,290 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-10-15 18:16:45,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:16:45,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976947244] [2022-10-15 18:16:45,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976947244] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 18:16:45,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834695314] [2022-10-15 18:16:45,291 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 18:16:45,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 18:16:45,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 18:16:45,293 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-10-15 18:16:45,304 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-10-15 18:16:45,443 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 18:16:45,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 18:16:45,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 61 conjunts are in the unsatisfiable core [2022-10-15 18:16:45,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 18:16:45,463 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-10-15 18:16:45,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:45,653 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 0 case distinctions, treesize of input 17 treesize of output 17 [2022-10-15 18:16:45,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:45,746 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-10-15 18:16:45,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:45,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-10-15 18:16:45,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:45,845 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-10-15 18:16:45,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:45,953 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-10-15 18:16:45,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-10-15 18:16:46,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-10-15 18:16:46,041 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-10-15 18:16:46,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:46,166 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-10-15 18:16:46,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:46,174 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-10-15 18:16:46,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:46,260 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-10-15 18:16:46,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:46,270 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-10-15 18:16:46,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:46,349 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-10-15 18:16:46,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:46,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 18:16:46,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:46,383 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-10-15 18:16:46,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:46,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 18:16:46,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:46,490 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-10-15 18:16:46,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 18:16:46,498 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-10-15 18:16:46,528 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-10-15 18:16:46,531 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-10-15 18:16:46,538 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 18:16:46,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 18:16:46,557 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_~new_last~0#1.base| v_ArrVal_924) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_~new_last~0#1.base| v_ArrVal_923) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-10-15 18:16:46,574 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_~new_last~0#1.base_12| Int)) (or (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_sll_append_~new_last~0#1.base_12| v_ArrVal_924) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (<= |v_sll_append_~new_last~0#1.base_12| |c_sll_append_node_create_with_sublist_#res#1.base|)))) (forall ((|v_sll_append_~new_last~0#1.base_12| Int)) (or (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_sll_append_~new_last~0#1.base_12| v_ArrVal_923) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (<= |v_sll_append_~new_last~0#1.base_12| |c_sll_append_node_create_with_sublist_#res#1.base|))))) is different from false [2022-10-15 18:16:46,598 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_923 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store |c_#memory_$Pointer$.base| |v_sll_append_~new_last~0#1.base_12| v_ArrVal_923) |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_12|))) (forall ((v_ArrVal_924 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store |c_#memory_$Pointer$.offset| |v_sll_append_~new_last~0#1.base_12| v_ArrVal_924) |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_12|)))) is different from false [2022-10-15 18:16:46,619 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_921 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_12|) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_921) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_923) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_922) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_924) |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_12|)))) is different from false [2022-10-15 18:16:46,728 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_921 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_918 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_918) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_921) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_923) |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_12|))) (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_917 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_917) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_922) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_924) |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_12|)))) is different from false [2022-10-15 18:16:46,779 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_917 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_917) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_922) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_924) |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_12|))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_921 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_918 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_918) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_921) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_923) |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_12|)))))) is different from false [2022-10-15 18:16:46,861 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_916 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_917 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_12|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_916) |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_917) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_922) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_924) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_915 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_921 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_918 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_915) |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_918) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_921) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_923) |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_12|)))))) is different from false [2022-10-15 18:16:47,006 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_38| Int)) (or (forall ((v_ArrVal_915 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_921 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_918 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_38| v_ArrVal_915) |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_918) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_921) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_923) |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_12|))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_38| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_38| Int)) (or (forall ((v_ArrVal_916 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_917 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_12|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_38| v_ArrVal_916) |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_917) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_922) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_924) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_38| |c_#StackHeapBarrier|))))) is different from false [2022-10-15 18:16:47,137 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_914 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_38| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_38| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_916 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_917 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| 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_914) |v_sll_append_sll_create_~new_head~0#1.base_38| v_ArrVal_916) |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_917) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_922) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_924) |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_12|))))))) (forall ((v_ArrVal_913 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_38| Int)) (or (forall ((v_ArrVal_915 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_921 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_918 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| 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_913) |v_sll_append_sll_create_~new_head~0#1.base_38| v_ArrVal_915) |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_918) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_921) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_923) |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_12|))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_38| |c_#StackHeapBarrier|))))) is different from false [2022-10-15 18:16:52,557 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 4 trivial. 27 not checked. [2022-10-15 18:16:52,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834695314] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 18:16:52,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 18:16:52,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 19] total 40 [2022-10-15 18:16:52,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883757889] [2022-10-15 18:16:52,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 18:16:52,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-10-15 18:16:52,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:16:52,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-10-15 18:16:52,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=786, Unknown=15, NotChecked=594, Total=1560 [2022-10-15 18:16:52,561 INFO L87 Difference]: Start difference. First operand 256 states and 309 transitions. Second operand has 40 states, 40 states have (on average 2.55) internal successors, (102), 37 states have internal predecessors, (102), 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-10-15 18:16:54,925 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 |c_#valid| |sll_append_sll_create_~new_head~0#1.base|) 1))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= (select |c_#valid| |c_sll_append_~head#1.base|) 1) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_38| Int)) (or (forall ((v_ArrVal_915 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_921 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_918 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_38| v_ArrVal_915) |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_918) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_921) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_923) |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_12|))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_38| |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|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_38| Int)) (or (forall ((v_ArrVal_916 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_917 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_12|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_38| v_ArrVal_916) |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_917) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_922) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_924) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_38| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-10-15 18:16:56,932 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 |c_#valid| |sll_append_sll_create_~new_head~0#1.base|) 1))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= (select |c_#valid| |c_sll_append_~head#1.base|) 1) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_38| Int)) (or (forall ((v_ArrVal_915 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_921 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_918 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_38| v_ArrVal_915) |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_918) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_921) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_923) |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_12|))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_38| |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_38| Int)) (or (forall ((v_ArrVal_916 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_917 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_12|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_38| v_ArrVal_916) |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_917) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_922) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_924) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_38| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-10-15 18:16:58,997 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_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_917 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_917) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_922) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_924) |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_12|))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_38| Int)) (or (forall ((v_ArrVal_915 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_921 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_918 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_38| v_ArrVal_915) |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_918) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_921) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_923) |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_12|))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_38| |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|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_921 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_918 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_918) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_921) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_923) |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_12|))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_38| Int)) (or (forall ((v_ArrVal_916 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_917 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_12|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_38| v_ArrVal_916) |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_917) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_922) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_924) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_38| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-10-15 18:17:01,004 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_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_917 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_917) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_922) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_924) |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_12|))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_38| Int)) (or (forall ((v_ArrVal_915 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_921 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_918 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_38| v_ArrVal_915) |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_918) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_921) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_923) |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_12|))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_38| |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_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_921 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_918 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_918) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_921) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_923) |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_12|))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_38| Int)) (or (forall ((v_ArrVal_916 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_37| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_37| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_917 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_12| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_12|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_38| v_ArrVal_916) |v_sll_append_sll_create_~new_head~0#1.base_37| v_ArrVal_917) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_922) |v_sll_append_~new_last~0#1.base_12| v_ArrVal_924) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_38| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-10-15 18:17:01,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:17:01,516 INFO L93 Difference]: Finished difference Result 340 states and 404 transitions. [2022-10-15 18:17:01,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-15 18:17:01,518 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.55) internal successors, (102), 37 states have internal predecessors, (102), 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-10-15 18:17:01,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:17:01,520 INFO L225 Difference]: With dead ends: 340 [2022-10-15 18:17:01,520 INFO L226 Difference]: Without dead ends: 340 [2022-10-15 18:17:01,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=255, Invalid=1110, Unknown=19, NotChecked=1066, Total=2450 [2022-10-15 18:17:01,524 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 30 mSDsluCounter, 1983 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 2083 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 683 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 18:17:01,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 2083 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 387 Invalid, 0 Unknown, 683 Unchecked, 0.4s Time] [2022-10-15 18:17:01,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-10-15 18:17:01,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 336. [2022-10-15 18:17:01,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 296 states have (on average 1.287162162162162) internal successors, (381), 325 states have internal predecessors, (381), 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-10-15 18:17:01,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 400 transitions. [2022-10-15 18:17:01,536 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 400 transitions. Word has length 44 [2022-10-15 18:17:01,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:17:01,536 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 400 transitions. [2022-10-15 18:17:01,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.55) internal successors, (102), 37 states have internal predecessors, (102), 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-10-15 18:17:01,537 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 400 transitions. [2022-10-15 18:17:01,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-10-15 18:17:01,538 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:17:01,538 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-10-15 18:17:01,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-10-15 18:17:01,752 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-10-15 18:17:01,753 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-15 18:17:01,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:17:01,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1659810607, now seen corresponding path program 1 times [2022-10-15 18:17:01,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:17:01,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249632233] [2022-10-15 18:17:01,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:17:01,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:17:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:17:01,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-15 18:17:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:17:01,910 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-10-15 18:17:01,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:17:01,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249632233] [2022-10-15 18:17:01,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249632233] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:17:01,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:17:01,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 18:17:01,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571076201] [2022-10-15 18:17:01,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:17:01,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 18:17:01,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:17:01,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 18:17:01,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 18:17:01,912 INFO L87 Difference]: Start difference. First operand 336 states and 400 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-10-15 18:17:02,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:17:02,042 INFO L93 Difference]: Finished difference Result 392 states and 462 transitions. [2022-10-15 18:17:02,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 18:17:02,044 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-10-15 18:17:02,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:17:02,047 INFO L225 Difference]: With dead ends: 392 [2022-10-15 18:17:02,048 INFO L226 Difference]: Without dead ends: 392 [2022-10-15 18:17:02,049 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-10-15 18:17:02,052 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-10-15 18:17:02,052 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-10-15 18:17:02,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2022-10-15 18:17:02,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 336. [2022-10-15 18:17:02,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 296 states have (on average 1.287162162162162) internal successors, (381), 325 states have internal predecessors, (381), 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-10-15 18:17:02,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 400 transitions. [2022-10-15 18:17:02,072 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 400 transitions. Word has length 54 [2022-10-15 18:17:02,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:17:02,072 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 400 transitions. [2022-10-15 18:17:02,073 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-10-15 18:17:02,073 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 400 transitions. [2022-10-15 18:17:02,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-15 18:17:02,074 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:17:02,074 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-10-15 18:17:02,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-10-15 18:17:02,074 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-15 18:17:02,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:17:02,075 INFO L85 PathProgramCache]: Analyzing trace with hash -85479915, now seen corresponding path program 1 times [2022-10-15 18:17:02,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:17:02,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010511045] [2022-10-15 18:17:02,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:17:02,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:17:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:17:02,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-15 18:17:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:17:02,613 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-10-15 18:17:02,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:17:02,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010511045] [2022-10-15 18:17:02,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010511045] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:17:02,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:17:02,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-15 18:17:02,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195816712] [2022-10-15 18:17:02,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:17:02,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-15 18:17:02,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:17:02,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-15 18:17:02,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-10-15 18:17:02,615 INFO L87 Difference]: Start difference. First operand 336 states and 400 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-10-15 18:17:03,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:17:03,078 INFO L93 Difference]: Finished difference Result 542 states and 658 transitions. [2022-10-15 18:17:03,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-15 18:17:03,080 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-10-15 18:17:03,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:17:03,083 INFO L225 Difference]: With dead ends: 542 [2022-10-15 18:17:03,084 INFO L226 Difference]: Without dead ends: 542 [2022-10-15 18:17:03,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-10-15 18:17:03,085 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 303 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 18:17:03,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 540 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 18:17:03,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-10-15 18:17:03,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 349. [2022-10-15 18:17:03,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 310 states have (on average 1.2967741935483872) internal successors, (402), 337 states have internal predecessors, (402), 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-10-15 18:17:03,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 421 transitions. [2022-10-15 18:17:03,100 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 421 transitions. Word has length 55 [2022-10-15 18:17:03,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:17:03,100 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 421 transitions. [2022-10-15 18:17:03,100 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-10-15 18:17:03,100 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 421 transitions. [2022-10-15 18:17:03,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-15 18:17:03,101 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:17:03,102 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-10-15 18:17:03,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-10-15 18:17:03,102 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-15 18:17:03,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:17:03,102 INFO L85 PathProgramCache]: Analyzing trace with hash -85479914, now seen corresponding path program 1 times [2022-10-15 18:17:03,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:17:03,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993093479] [2022-10-15 18:17:03,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:17:03,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:17:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:17:03,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-10-15 18:17:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:17:03,916 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-10-15 18:17:03,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:17:03,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993093479] [2022-10-15 18:17:03,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993093479] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:17:03,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:17:03,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-15 18:17:03,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941413369] [2022-10-15 18:17:03,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:17:03,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-15 18:17:03,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:17:03,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-15 18:17:03,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-15 18:17:03,919 INFO L87 Difference]: Start difference. First operand 349 states and 421 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-10-15 18:17:04,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:17:04,476 INFO L93 Difference]: Finished difference Result 551 states and 684 transitions. [2022-10-15 18:17:04,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-15 18:17:04,477 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-10-15 18:17:04,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:17:04,484 INFO L225 Difference]: With dead ends: 551 [2022-10-15 18:17:04,484 INFO L226 Difference]: Without dead ends: 551 [2022-10-15 18:17:04,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-10-15 18:17:04,486 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 273 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 664 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.4s IncrementalHoareTripleChecker+Time [2022-10-15 18:17:04,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 664 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 18:17:04,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2022-10-15 18:17:04,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 385. [2022-10-15 18:17:04,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 346 states have (on average 1.3208092485549132) internal successors, (457), 373 states have internal predecessors, (457), 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-10-15 18:17:04,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 476 transitions. [2022-10-15 18:17:04,524 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 476 transitions. Word has length 55 [2022-10-15 18:17:04,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:17:04,525 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 476 transitions. [2022-10-15 18:17:04,525 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-10-15 18:17:04,525 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 476 transitions. [2022-10-15 18:17:04,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-10-15 18:17:04,527 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:17:04,527 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-10-15 18:17:04,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-10-15 18:17:04,527 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-10-15 18:17:04,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:17:04,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1645084350, now seen corresponding path program 1 times [2022-10-15 18:17:04,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:17:04,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107766236] [2022-10-15 18:17:04,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:17:04,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:17:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat