./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 68e1c5cf050539b3ee8f058d38ff7af5aea2a400d05e41e0185e4509f45301e0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 17:56:41,191 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 17:56:41,193 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 17:56:41,231 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 17:56:41,232 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 17:56:41,234 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 17:56:41,235 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 17:56:41,237 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 17:56:41,239 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 17:56:41,242 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 17:56:41,242 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 17:56:41,243 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 17:56:41,244 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 17:56:41,245 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 17:56:41,246 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 17:56:41,249 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 17:56:41,249 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 17:56:41,250 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 17:56:41,251 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 17:56:41,255 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 17:56:41,256 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 17:56:41,256 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 17:56:41,257 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 17:56:41,258 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 17:56:41,262 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 17:56:41,263 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 17:56:41,263 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 17:56:41,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 17:56:41,264 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 17:56:41,265 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 17:56:41,265 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 17:56:41,266 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 17:56:41,267 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 17:56:41,268 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 17:56:41,269 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 17:56:41,270 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 17:56:41,270 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 17:56:41,270 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 17:56:41,270 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 17:56:41,271 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 17:56:41,271 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 17:56:41,272 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-12-21 17:56:41,295 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 17:56:41,295 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 17:56:41,295 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 17:56:41,295 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 17:56:41,296 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 17:56:41,296 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 17:56:41,297 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 17:56:41,297 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 17:56:41,297 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 17:56:41,297 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 17:56:41,298 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 17:56:41,298 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 17:56:41,298 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 17:56:41,298 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 17:56:41,298 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 17:56:41,298 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-21 17:56:41,298 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-21 17:56:41,298 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 17:56:41,299 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-21 17:56:41,299 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 17:56:41,299 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 17:56:41,299 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 17:56:41,299 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 17:56:41,299 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 17:56:41,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 17:56:41,300 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 17:56:41,300 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 17:56:41,300 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 17:56:41,300 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 17:56:41,300 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 17:56:41,301 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 68e1c5cf050539b3ee8f058d38ff7af5aea2a400d05e41e0185e4509f45301e0 [2021-12-21 17:56:41,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 17:56:41,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 17:56:41,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 17:56:41,518 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 17:56:41,518 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 17:56:41,519 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 [2021-12-21 17:56:41,558 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a40486a78/919060cf4437488ca6ef57f2944a6e5e/FLAG9fec3da24 [2021-12-21 17:56:41,905 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 17:56:41,905 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i [2021-12-21 17:56:41,913 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a40486a78/919060cf4437488ca6ef57f2944a6e5e/FLAG9fec3da24 [2021-12-21 17:56:42,320 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a40486a78/919060cf4437488ca6ef57f2944a6e5e [2021-12-21 17:56:42,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 17:56:42,324 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 17:56:42,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 17:56:42,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 17:56:42,328 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 17:56:42,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 05:56:42" (1/1) ... [2021-12-21 17:56:42,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c33ca1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:56:42, skipping insertion in model container [2021-12-21 17:56:42,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 05:56:42" (1/1) ... [2021-12-21 17:56:42,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 17:56:42,370 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 17:56:42,635 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] [2021-12-21 17:56:42,638 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 17:56:42,645 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 17:56:42,684 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] [2021-12-21 17:56:42,686 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 17:56:42,709 INFO L208 MainTranslator]: Completed translation [2021-12-21 17:56:42,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:56:42 WrapperNode [2021-12-21 17:56:42,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 17:56:42,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 17:56:42,712 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 17:56:42,712 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 17:56:42,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:56:42" (1/1) ... [2021-12-21 17:56:42,733 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:56:42" (1/1) ... [2021-12-21 17:56:42,749 INFO L137 Inliner]: procedures = 129, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 186 [2021-12-21 17:56:42,751 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 17:56:42,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 17:56:42,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 17:56:42,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 17:56:42,757 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:56:42" (1/1) ... [2021-12-21 17:56:42,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:56:42" (1/1) ... [2021-12-21 17:56:42,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:56:42" (1/1) ... [2021-12-21 17:56:42,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:56:42" (1/1) ... [2021-12-21 17:56:42,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:56:42" (1/1) ... [2021-12-21 17:56:42,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:56:42" (1/1) ... [2021-12-21 17:56:42,781 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:56:42" (1/1) ... [2021-12-21 17:56:42,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 17:56:42,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 17:56:42,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 17:56:42,784 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 17:56:42,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:56:42" (1/1) ... [2021-12-21 17:56:42,794 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 17:56:42,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 17:56:42,815 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) [2021-12-21 17:56:42,833 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 [2021-12-21 17:56:42,844 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-12-21 17:56:42,845 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-12-21 17:56:42,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 17:56:42,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 17:56:42,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 17:56:42,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 17:56:42,846 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2021-12-21 17:56:42,846 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2021-12-21 17:56:42,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 17:56:42,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 17:56:42,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-21 17:56:42,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 17:56:42,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 17:56:42,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 17:56:42,915 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 17:56:42,916 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 17:56:42,946 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-12-21 17:56:43,262 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 17:56:43,268 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 17:56:43,269 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-21 17:56:43,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 05:56:43 BoogieIcfgContainer [2021-12-21 17:56:43,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 17:56:43,273 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 17:56:43,273 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 17:56:43,276 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 17:56:43,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 05:56:42" (1/3) ... [2021-12-21 17:56:43,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b031965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 05:56:43, skipping insertion in model container [2021-12-21 17:56:43,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:56:42" (2/3) ... [2021-12-21 17:56:43,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b031965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 05:56:43, skipping insertion in model container [2021-12-21 17:56:43,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 05:56:43" (3/3) ... [2021-12-21 17:56:43,278 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-2.i [2021-12-21 17:56:43,282 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 17:56:43,282 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2021-12-21 17:56:43,319 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 17:56:43,325 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-21 17:56:43,325 INFO L340 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2021-12-21 17:56:43,338 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) [2021-12-21 17:56:43,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-21 17:56:43,343 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:56:43,344 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 17:56:43,344 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting sll_appendErr1REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-21 17:56:43,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:56:43,348 INFO L85 PathProgramCache]: Analyzing trace with hash -46006015, now seen corresponding path program 1 times [2021-12-21 17:56:43,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:56:43,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435358052] [2021-12-21 17:56:43,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:56:43,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:56:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:56:43,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 17:56:43,464 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:56:43,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435358052] [2021-12-21 17:56:43,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435358052] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:56:43,465 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:56:43,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 17:56:43,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164137524] [2021-12-21 17:56:43,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:56:43,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 17:56:43,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:56:43,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 17:56:43,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 17:56:43,490 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) [2021-12-21 17:56:43,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:56:43,541 INFO L93 Difference]: Finished difference Result 128 states and 147 transitions. [2021-12-21 17:56:43,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 17:56:43,543 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 [2021-12-21 17:56:43,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:56:43,549 INFO L225 Difference]: With dead ends: 128 [2021-12-21 17:56:43,550 INFO L226 Difference]: Without dead ends: 122 [2021-12-21 17:56:43,551 INFO L932 BasicCegarLoop]: 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 [2021-12-21 17:56:43,555 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 7 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 17:56:43,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 259 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 17:56:43,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-12-21 17:56:43,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 116. [2021-12-21 17:56:43,581 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) [2021-12-21 17:56:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 130 transitions. [2021-12-21 17:56:43,583 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 130 transitions. Word has length 10 [2021-12-21 17:56:43,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:56:43,584 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 130 transitions. [2021-12-21 17:56:43,584 INFO L471 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) [2021-12-21 17:56:43,584 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 130 transitions. [2021-12-21 17:56:43,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-21 17:56:43,584 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:56:43,585 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 17:56:43,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 17:56:43,585 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting sll_appendErr1REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-21 17:56:43,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:56:43,586 INFO L85 PathProgramCache]: Analyzing trace with hash 244152622, now seen corresponding path program 1 times [2021-12-21 17:56:43,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:56:43,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638786133] [2021-12-21 17:56:43,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:56:43,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:56:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:56:43,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 17:56:43,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:56:43,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638786133] [2021-12-21 17:56:43,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638786133] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:56:43,640 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:56:43,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 17:56:43,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582015998] [2021-12-21 17:56:43,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:56:43,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 17:56:43,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:56:43,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 17:56:43,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 17:56:43,643 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) [2021-12-21 17:56:43,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:56:43,714 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2021-12-21 17:56:43,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 17:56:43,714 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 [2021-12-21 17:56:43,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:56:43,716 INFO L225 Difference]: With dead ends: 151 [2021-12-21 17:56:43,716 INFO L226 Difference]: Without dead ends: 151 [2021-12-21 17:56:43,717 INFO L932 BasicCegarLoop]: 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 [2021-12-21 17:56:43,717 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 40 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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 [2021-12-21 17:56:43,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 234 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 17:56:43,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-21 17:56:43,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 115. [2021-12-21 17:56:43,724 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) [2021-12-21 17:56:43,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2021-12-21 17:56:43,744 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 13 [2021-12-21 17:56:43,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:56:43,745 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2021-12-21 17:56:43,745 INFO L471 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) [2021-12-21 17:56:43,746 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2021-12-21 17:56:43,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-21 17:56:43,747 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:56:43,747 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 17:56:43,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 17:56:43,748 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting sll_appendErr0REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-21 17:56:43,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:56:43,749 INFO L85 PathProgramCache]: Analyzing trace with hash 244152621, now seen corresponding path program 1 times [2021-12-21 17:56:43,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:56:43,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868865085] [2021-12-21 17:56:43,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:56:43,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:56:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:56:43,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 17:56:43,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:56:43,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868865085] [2021-12-21 17:56:43,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868865085] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:56:43,863 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:56:43,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 17:56:43,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234372473] [2021-12-21 17:56:43,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:56:43,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 17:56:43,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:56:43,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 17:56:43,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 17:56:43,865 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) [2021-12-21 17:56:43,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:56:43,972 INFO L93 Difference]: Finished difference Result 150 states and 168 transitions. [2021-12-21 17:56:43,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 17:56:43,973 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 [2021-12-21 17:56:43,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:56:43,976 INFO L225 Difference]: With dead ends: 150 [2021-12-21 17:56:43,977 INFO L226 Difference]: Without dead ends: 150 [2021-12-21 17:56:43,977 INFO L932 BasicCegarLoop]: 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 [2021-12-21 17:56:43,982 INFO L933 BasicCegarLoop]: 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 [2021-12-21 17:56:43,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 228 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 17:56:43,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-21 17:56:43,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 114. [2021-12-21 17:56:43,997 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) [2021-12-21 17:56:43,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2021-12-21 17:56:43,999 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 13 [2021-12-21 17:56:43,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:56:44,000 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2021-12-21 17:56:44,000 INFO L471 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) [2021-12-21 17:56:44,000 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2021-12-21 17:56:44,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-21 17:56:44,001 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:56:44,010 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 17:56:44,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 17:56:44,011 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting sll_appendErr2REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-21 17:56:44,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:56:44,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1021253985, now seen corresponding path program 1 times [2021-12-21 17:56:44,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:56:44,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480771734] [2021-12-21 17:56:44,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:56:44,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:56:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:56:44,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 17:56:44,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:56:44,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480771734] [2021-12-21 17:56:44,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480771734] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:56:44,074 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:56:44,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 17:56:44,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983094385] [2021-12-21 17:56:44,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:56:44,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 17:56:44,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:56:44,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 17:56:44,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 17:56:44,076 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) [2021-12-21 17:56:44,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:56:44,119 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2021-12-21 17:56:44,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 17:56:44,119 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 [2021-12-21 17:56:44,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:56:44,120 INFO L225 Difference]: With dead ends: 112 [2021-12-21 17:56:44,120 INFO L226 Difference]: Without dead ends: 112 [2021-12-21 17:56:44,120 INFO L932 BasicCegarLoop]: 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 [2021-12-21 17:56:44,121 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 35 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 17:56:44,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 162 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 17:56:44,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-12-21 17:56:44,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2021-12-21 17:56:44,125 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) [2021-12-21 17:56:44,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2021-12-21 17:56:44,125 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 14 [2021-12-21 17:56:44,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:56:44,126 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2021-12-21 17:56:44,126 INFO L471 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) [2021-12-21 17:56:44,126 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2021-12-21 17:56:44,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-21 17:56:44,126 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:56:44,126 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 17:56:44,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 17:56:44,127 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting sll_appendErr3REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-21 17:56:44,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:56:44,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1021253984, now seen corresponding path program 1 times [2021-12-21 17:56:44,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:56:44,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431799681] [2021-12-21 17:56:44,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:56:44,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:56:44,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:56:44,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 17:56:44,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:56:44,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431799681] [2021-12-21 17:56:44,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431799681] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:56:44,187 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:56:44,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 17:56:44,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528887973] [2021-12-21 17:56:44,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:56:44,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 17:56:44,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:56:44,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 17:56:44,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 17:56:44,189 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) [2021-12-21 17:56:44,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:56:44,245 INFO L93 Difference]: Finished difference Result 213 states and 236 transitions. [2021-12-21 17:56:44,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 17:56:44,246 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 [2021-12-21 17:56:44,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:56:44,247 INFO L225 Difference]: With dead ends: 213 [2021-12-21 17:56:44,247 INFO L226 Difference]: Without dead ends: 213 [2021-12-21 17:56:44,247 INFO L932 BasicCegarLoop]: 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 [2021-12-21 17:56:44,248 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 160 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 17:56:44,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 892 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 17:56:44,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-12-21 17:56:44,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 139. [2021-12-21 17:56:44,253 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) [2021-12-21 17:56:44,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 169 transitions. [2021-12-21 17:56:44,254 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 169 transitions. Word has length 14 [2021-12-21 17:56:44,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:56:44,254 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 169 transitions. [2021-12-21 17:56:44,255 INFO L471 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) [2021-12-21 17:56:44,255 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 169 transitions. [2021-12-21 17:56:44,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-21 17:56:44,255 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:56:44,255 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 17:56:44,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 17:56:44,256 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting sll_appendErr3REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-21 17:56:44,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:56:44,256 INFO L85 PathProgramCache]: Analyzing trace with hash -790832604, now seen corresponding path program 1 times [2021-12-21 17:56:44,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:56:44,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199853798] [2021-12-21 17:56:44,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:56:44,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:56:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:56:44,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 17:56:44,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:56:44,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199853798] [2021-12-21 17:56:44,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199853798] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 17:56:44,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392353282] [2021-12-21 17:56:44,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:56:44,287 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 17:56:44,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 17:56:44,300 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) [2021-12-21 17:56:44,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-21 17:56:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:56:44,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 17:56:44,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 17:56:44,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 17:56:44,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 17:56:44,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 17:56:44,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392353282] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 17:56:44,460 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 17:56:44,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-12-21 17:56:44,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138668608] [2021-12-21 17:56:44,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 17:56:44,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 17:56:44,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:56:44,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 17:56:44,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2021-12-21 17:56:44,462 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) [2021-12-21 17:56:44,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:56:44,499 INFO L93 Difference]: Finished difference Result 192 states and 229 transitions. [2021-12-21 17:56:44,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 17:56:44,500 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 [2021-12-21 17:56:44,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:56:44,502 INFO L225 Difference]: With dead ends: 192 [2021-12-21 17:56:44,502 INFO L226 Difference]: Without dead ends: 192 [2021-12-21 17:56:44,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2021-12-21 17:56:44,503 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 91 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 17:56:44,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 517 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 17:56:44,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-12-21 17:56:44,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 156. [2021-12-21 17:56:44,523 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) [2021-12-21 17:56:44,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 193 transitions. [2021-12-21 17:56:44,524 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 193 transitions. Word has length 16 [2021-12-21 17:56:44,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:56:44,524 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 193 transitions. [2021-12-21 17:56:44,524 INFO L471 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) [2021-12-21 17:56:44,524 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 193 transitions. [2021-12-21 17:56:44,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-21 17:56:44,525 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:56:44,525 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 17:56:44,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-21 17:56:44,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-21 17:56:44,743 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting sll_appendErr3REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-21 17:56:44,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:56:44,743 INFO L85 PathProgramCache]: Analyzing trace with hash -924446423, now seen corresponding path program 1 times [2021-12-21 17:56:44,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:56:44,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266204333] [2021-12-21 17:56:44,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:56:44,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:56:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:56:44,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 17:56:44,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:56:44,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266204333] [2021-12-21 17:56:44,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266204333] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 17:56:44,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346360619] [2021-12-21 17:56:44,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:56:44,815 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 17:56:44,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 17:56:44,817 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) [2021-12-21 17:56:44,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-21 17:56:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:56:44,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-21 17:56:44,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 17:56:44,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 17:56:44,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 17:56:45,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 17:56:45,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346360619] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 17:56:45,011 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 17:56:45,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-21 17:56:45,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161091820] [2021-12-21 17:56:45,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 17:56:45,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 17:56:45,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:56:45,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 17:56:45,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-21 17:56:45,013 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) [2021-12-21 17:56:45,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:56:45,107 INFO L93 Difference]: Finished difference Result 238 states and 269 transitions. [2021-12-21 17:56:45,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 17:56:45,108 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 [2021-12-21 17:56:45,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:56:45,109 INFO L225 Difference]: With dead ends: 238 [2021-12-21 17:56:45,109 INFO L226 Difference]: Without dead ends: 238 [2021-12-21 17:56:45,109 INFO L932 BasicCegarLoop]: 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 [2021-12-21 17:56:45,110 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 291 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 17:56:45,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 1266 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 17:56:45,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-12-21 17:56:45,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 164. [2021-12-21 17:56:45,115 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) [2021-12-21 17:56:45,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 201 transitions. [2021-12-21 17:56:45,116 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 201 transitions. Word has length 18 [2021-12-21 17:56:45,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:56:45,116 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 201 transitions. [2021-12-21 17:56:45,116 INFO L471 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) [2021-12-21 17:56:45,116 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 201 transitions. [2021-12-21 17:56:45,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-21 17:56:45,117 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:56:45,117 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 17:56:45,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-21 17:56:45,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-12-21 17:56:45,335 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting sll_appendErr3REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-21 17:56:45,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:56:45,335 INFO L85 PathProgramCache]: Analyzing trace with hash 760370116, now seen corresponding path program 2 times [2021-12-21 17:56:45,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:56:45,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015164593] [2021-12-21 17:56:45,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:56:45,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:56:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:56:45,372 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-21 17:56:45,372 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:56:45,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015164593] [2021-12-21 17:56:45,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015164593] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:56:45,372 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:56:45,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 17:56:45,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535259593] [2021-12-21 17:56:45,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:56:45,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 17:56:45,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:56:45,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 17:56:45,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 17:56:45,374 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) [2021-12-21 17:56:45,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:56:45,401 INFO L93 Difference]: Finished difference Result 182 states and 205 transitions. [2021-12-21 17:56:45,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 17:56:45,401 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 [2021-12-21 17:56:45,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:56:45,402 INFO L225 Difference]: With dead ends: 182 [2021-12-21 17:56:45,402 INFO L226 Difference]: Without dead ends: 182 [2021-12-21 17:56:45,402 INFO L932 BasicCegarLoop]: 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 [2021-12-21 17:56:45,403 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 162 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 17:56:45,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 641 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 17:56:45,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-12-21 17:56:45,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2021-12-21 17:56:45,407 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) [2021-12-21 17:56:45,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 202 transitions. [2021-12-21 17:56:45,408 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 202 transitions. Word has length 26 [2021-12-21 17:56:45,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:56:45,408 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 202 transitions. [2021-12-21 17:56:45,408 INFO L471 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) [2021-12-21 17:56:45,408 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 202 transitions. [2021-12-21 17:56:45,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-21 17:56:45,409 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:56:45,409 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 17:56:45,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-21 17:56:45,409 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting sll_appendErr3REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-21 17:56:45,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:56:45,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1087676229, now seen corresponding path program 2 times [2021-12-21 17:56:45,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:56:45,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178556458] [2021-12-21 17:56:45,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:56:45,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:56:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:56:45,501 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 17:56:45,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:56:45,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178556458] [2021-12-21 17:56:45,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178556458] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 17:56:45,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552295199] [2021-12-21 17:56:45,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 17:56:45,502 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 17:56:45,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 17:56:45,503 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) [2021-12-21 17:56:45,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-21 17:56:45,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 17:56:45,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 17:56:45,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-21 17:56:45,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 17:56:45,622 INFO L387 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 [2021-12-21 17:56:45,628 INFO L387 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 [2021-12-21 17:56:45,671 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-21 17:56:45,671 INFO L387 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 [2021-12-21 17:56:45,677 INFO L387 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 [2021-12-21 17:56:45,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:56:45,718 INFO L387 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 [2021-12-21 17:56:45,724 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 17:56:45,725 INFO L387 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 [2021-12-21 17:56:45,774 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-21 17:56:45,774 INFO L387 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 [2021-12-21 17:56:45,820 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 17:56:45,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 17:56:46,570 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 17:56:46,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552295199] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 17:56:46,570 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 17:56:46,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 4] total 8 [2021-12-21 17:56:46,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511523237] [2021-12-21 17:56:46,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 17:56:46,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 17:56:46,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:56:46,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 17:56:46,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-12-21 17:56:46,572 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) [2021-12-21 17:56:46,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:56:46,604 INFO L93 Difference]: Finished difference Result 163 states and 198 transitions. [2021-12-21 17:56:46,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 17:56:46,604 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 [2021-12-21 17:56:46,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:56:46,605 INFO L225 Difference]: With dead ends: 163 [2021-12-21 17:56:46,605 INFO L226 Difference]: Without dead ends: 163 [2021-12-21 17:56:46,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2021-12-21 17:56:46,606 INFO L933 BasicCegarLoop]: 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 [2021-12-21 17:56:46,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 272 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 55 Unchecked, 0.0s Time] [2021-12-21 17:56:46,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-12-21 17:56:46,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2021-12-21 17:56:46,609 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) [2021-12-21 17:56:46,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 198 transitions. [2021-12-21 17:56:46,610 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 198 transitions. Word has length 26 [2021-12-21 17:56:46,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:56:46,610 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 198 transitions. [2021-12-21 17:56:46,610 INFO L471 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) [2021-12-21 17:56:46,610 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 198 transitions. [2021-12-21 17:56:46,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-21 17:56:46,611 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:56:46,611 INFO L514 BasicCegarLoop]: 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] [2021-12-21 17:56:46,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-21 17:56:46,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 17:56:46,828 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting sll_appendErr6REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-21 17:56:46,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:56:46,829 INFO L85 PathProgramCache]: Analyzing trace with hash 320066679, now seen corresponding path program 1 times [2021-12-21 17:56:46,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:56:46,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464274236] [2021-12-21 17:56:46,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:56:46,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:56:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:56:46,885 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-21 17:56:46,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:56:46,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464274236] [2021-12-21 17:56:46,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464274236] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:56:46,886 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:56:46,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 17:56:46,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342335659] [2021-12-21 17:56:46,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:56:46,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 17:56:46,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:56:46,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 17:56:46,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 17:56:46,888 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) [2021-12-21 17:56:46,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:56:46,951 INFO L93 Difference]: Finished difference Result 162 states and 196 transitions. [2021-12-21 17:56:46,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 17:56:46,952 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 [2021-12-21 17:56:46,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:56:46,954 INFO L225 Difference]: With dead ends: 162 [2021-12-21 17:56:46,954 INFO L226 Difference]: Without dead ends: 162 [2021-12-21 17:56:46,954 INFO L932 BasicCegarLoop]: 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 [2021-12-21 17:56:46,955 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 83 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 17:56:46,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 288 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 17:56:46,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-12-21 17:56:46,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2021-12-21 17:56:46,960 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) [2021-12-21 17:56:46,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 196 transitions. [2021-12-21 17:56:46,960 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 196 transitions. Word has length 31 [2021-12-21 17:56:46,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:56:46,961 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 196 transitions. [2021-12-21 17:56:46,961 INFO L471 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) [2021-12-21 17:56:46,961 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 196 transitions. [2021-12-21 17:56:46,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-21 17:56:46,964 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:56:46,964 INFO L514 BasicCegarLoop]: 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] [2021-12-21 17:56:46,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-21 17:56:46,964 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting sll_appendErr7REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-21 17:56:46,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:56:46,965 INFO L85 PathProgramCache]: Analyzing trace with hash 320066680, now seen corresponding path program 1 times [2021-12-21 17:56:46,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:56:46,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287054214] [2021-12-21 17:56:46,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:56:46,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:56:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:56:47,057 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-21 17:56:47,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:56:47,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287054214] [2021-12-21 17:56:47,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287054214] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:56:47,058 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:56:47,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 17:56:47,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092010761] [2021-12-21 17:56:47,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:56:47,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 17:56:47,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:56:47,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 17:56:47,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-21 17:56:47,059 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) [2021-12-21 17:56:47,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:56:47,114 INFO L93 Difference]: Finished difference Result 161 states and 194 transitions. [2021-12-21 17:56:47,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 17:56:47,114 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 [2021-12-21 17:56:47,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:56:47,115 INFO L225 Difference]: With dead ends: 161 [2021-12-21 17:56:47,115 INFO L226 Difference]: Without dead ends: 161 [2021-12-21 17:56:47,116 INFO L932 BasicCegarLoop]: 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 [2021-12-21 17:56:47,116 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 108 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 17:56:47,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 326 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 17:56:47,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-12-21 17:56:47,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2021-12-21 17:56:47,121 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) [2021-12-21 17:56:47,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 194 transitions. [2021-12-21 17:56:47,121 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 194 transitions. Word has length 31 [2021-12-21 17:56:47,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:56:47,122 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 194 transitions. [2021-12-21 17:56:47,122 INFO L471 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) [2021-12-21 17:56:47,122 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 194 transitions. [2021-12-21 17:56:47,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-21 17:56:47,124 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:56:47,124 INFO L514 BasicCegarLoop]: 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] [2021-12-21 17:56:47,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-21 17:56:47,125 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting sll_appendErr8REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-21 17:56:47,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:56:47,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1332132480, now seen corresponding path program 1 times [2021-12-21 17:56:47,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:56:47,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65308153] [2021-12-21 17:56:47,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:56:47,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:56:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:56:47,246 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 17:56:47,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:56:47,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65308153] [2021-12-21 17:56:47,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65308153] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 17:56:47,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186242715] [2021-12-21 17:56:47,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:56:47,247 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 17:56:47,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 17:56:47,264 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) [2021-12-21 17:56:47,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-21 17:56:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:56:47,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-21 17:56:47,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 17:56:47,351 INFO L387 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 [2021-12-21 17:56:47,384 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-21 17:56:47,385 INFO L387 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 [2021-12-21 17:56:47,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:56:47,411 INFO L387 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 [2021-12-21 17:56:47,432 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-21 17:56:47,433 INFO L387 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 [2021-12-21 17:56:47,487 INFO L353 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2021-12-21 17:56:47,487 INFO L387 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 [2021-12-21 17:56:47,596 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-21 17:56:47,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 17:56:47,940 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-21 17:56:47,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186242715] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 17:56:47,940 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 17:56:47,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 17 [2021-12-21 17:56:47,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638355232] [2021-12-21 17:56:47,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 17:56:47,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-21 17:56:47,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:56:47,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-21 17:56:47,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-12-21 17:56:47,942 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) [2021-12-21 17:56:48,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:56:48,132 INFO L93 Difference]: Finished difference Result 222 states and 267 transitions. [2021-12-21 17:56:48,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 17:56:48,133 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 [2021-12-21 17:56:48,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:56:48,134 INFO L225 Difference]: With dead ends: 222 [2021-12-21 17:56:48,134 INFO L226 Difference]: Without dead ends: 222 [2021-12-21 17:56:48,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2021-12-21 17:56:48,135 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 283 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 17:56:48,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 782 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 341 Invalid, 0 Unknown, 164 Unchecked, 0.2s Time] [2021-12-21 17:56:48,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-12-21 17:56:48,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 213. [2021-12-21 17:56:48,138 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) [2021-12-21 17:56:48,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 265 transitions. [2021-12-21 17:56:48,139 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 265 transitions. Word has length 32 [2021-12-21 17:56:48,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:56:48,139 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 265 transitions. [2021-12-21 17:56:48,140 INFO L471 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) [2021-12-21 17:56:48,140 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 265 transitions. [2021-12-21 17:56:48,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-21 17:56:48,140 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:56:48,140 INFO L514 BasicCegarLoop]: 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] [2021-12-21 17:56:48,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-21 17:56:48,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 17:56:48,343 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting sll_appendErr9REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-21 17:56:48,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:56:48,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1332132481, now seen corresponding path program 1 times [2021-12-21 17:56:48,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:56:48,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131954645] [2021-12-21 17:56:48,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:56:48,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:56:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:56:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-21 17:56:48,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:56:48,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131954645] [2021-12-21 17:56:48,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131954645] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 17:56:48,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98055863] [2021-12-21 17:56:48,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:56:48,426 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 17:56:48,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 17:56:48,440 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) [2021-12-21 17:56:48,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-21 17:56:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:56:48,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-21 17:56:48,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 17:56:48,531 INFO L387 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 [2021-12-21 17:56:48,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:56:48,579 INFO L387 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 [2021-12-21 17:56:48,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:56:48,600 INFO L387 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 [2021-12-21 17:56:48,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:56:48,630 INFO L387 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 [2021-12-21 17:56:48,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:56:48,654 INFO L387 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 [2021-12-21 17:56:48,702 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-21 17:56:48,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 17:56:49,587 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-21 17:56:49,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98055863] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 17:56:49,588 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 17:56:49,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2021-12-21 17:56:49,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988379318] [2021-12-21 17:56:49,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 17:56:49,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-21 17:56:49,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:56:49,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-21 17:56:49,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-12-21 17:56:49,590 INFO L87 Difference]: Start difference. First operand 213 states and 265 transitions. Second operand has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:56:49,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:56:49,690 INFO L93 Difference]: Finished difference Result 219 states and 263 transitions. [2021-12-21 17:56:49,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 17:56:49,691 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-21 17:56:49,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:56:49,691 INFO L225 Difference]: With dead ends: 219 [2021-12-21 17:56:49,691 INFO L226 Difference]: Without dead ends: 219 [2021-12-21 17:56:49,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-12-21 17:56:49,692 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 68 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 17:56:49,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 483 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 147 Invalid, 0 Unknown, 97 Unchecked, 0.1s Time] [2021-12-21 17:56:49,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-12-21 17:56:49,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 212. [2021-12-21 17:56:49,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 170 states have (on average 1.4529411764705882) internal successors, (247), 204 states have internal predecessors, (247), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-21 17:56:49,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 261 transitions. [2021-12-21 17:56:49,696 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 261 transitions. Word has length 32 [2021-12-21 17:56:49,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:56:49,696 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 261 transitions. [2021-12-21 17:56:49,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:56:49,696 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 261 transitions. [2021-12-21 17:56:49,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-21 17:56:49,697 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:56:49,697 INFO L514 BasicCegarLoop]: 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] [2021-12-21 17:56:49,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-21 17:56:49,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-21 17:56:49,915 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting sll_appendErr10REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-21 17:56:49,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:56:49,916 INFO L85 PathProgramCache]: Analyzing trace with hash 60922559, now seen corresponding path program 1 times [2021-12-21 17:56:49,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:56:49,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607685067] [2021-12-21 17:56:49,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:56:49,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:56:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:56:50,109 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-21 17:56:50,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:56:50,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607685067] [2021-12-21 17:56:50,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607685067] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 17:56:50,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137664000] [2021-12-21 17:56:50,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:56:50,110 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 17:56:50,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 17:56:50,111 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) [2021-12-21 17:56:50,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-21 17:56:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:56:50,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-21 17:56:50,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 17:56:50,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:56:50,396 INFO L387 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 [2021-12-21 17:56:50,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:56:50,400 INFO L387 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 [2021-12-21 17:56:50,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:56:50,545 INFO L387 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 [2021-12-21 17:56:50,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:56:50,550 INFO L387 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 [2021-12-21 17:56:50,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:56:50,714 INFO L387 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 [2021-12-21 17:56:50,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:56:50,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:56:50,724 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-21 17:56:50,724 INFO L387 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 [2021-12-21 17:56:50,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:56:50,833 INFO L387 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 [2021-12-21 17:56:50,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:56:50,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:56:50,848 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-21 17:56:50,848 INFO L387 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 [2021-12-21 17:56:50,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:56:50,897 INFO L387 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 [2021-12-21 17:56:50,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:56:50,902 INFO L387 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 [2021-12-21 17:56:50,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:56:50,968 INFO L387 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 [2021-12-21 17:56:50,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:56:50,971 INFO L387 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 [2021-12-21 17:56:50,994 INFO L387 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 [2021-12-21 17:56:50,996 INFO L387 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 [2021-12-21 17:56:51,004 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 17:56:51,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 17:56:51,023 WARN L838 $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 [2021-12-21 17:56:51,031 WARN L838 $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 [2021-12-21 17:56:51,036 WARN L838 $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 [2021-12-21 17:56:51,073 WARN L838 $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 [2021-12-21 17:56:51,100 WARN L838 $PredicateComparison]: unable to prove that (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|)) (and (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)) (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 [2021-12-21 17:56:51,123 WARN L838 $PredicateComparison]: unable to prove that (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|)) (and (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)) (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))))) is different from false [2021-12-21 17:56:51,151 WARN L838 $PredicateComparison]: unable to prove that (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|)) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_494 (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)) (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 [2021-12-21 17:56:51,283 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| 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|)) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_494 (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)) (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 [2021-12-21 17:56:51,374 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| 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|)) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_494 (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)) (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|)))) is different from false [2021-12-21 17:56:51,517 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| 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|)) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (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)) (forall ((v_ArrVal_503 (Array Int Int)) (v_ArrVal_492 (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_27| |c_#StackHeapBarrier|)))) is different from false [2021-12-21 17:56:51,717 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int) (|v_sll_append_sll_create_~new_head~0#1.base_27| 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_28| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_503 (Array Int Int)) (v_ArrVal_492 (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)) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (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_27| |c_#StackHeapBarrier|)))) is different from false [2021-12-21 17:56:52,153 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int) (|v_sll_append_sll_create_~new_head~0#1.base_27| 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_28| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_503 (Array Int Int)) (v_ArrVal_492 (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)) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (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_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) is different from false [2021-12-21 17:56:52,324 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (and (forall ((v_ArrVal_503 (Array Int Int)) (v_ArrVal_492 (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)) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (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_28| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) is different from false [2021-12-21 17:56:52,935 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2021-12-21 17:56:52,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137664000] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 17:56:52,935 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 17:56:52,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 18] total 41 [2021-12-21 17:56:52,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82264253] [2021-12-21 17:56:52,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 17:56:52,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-21 17:56:52,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:56:52,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-21 17:56:52,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=632, Unknown=13, NotChecked=832, Total=1640 [2021-12-21 17:56:52,937 INFO L87 Difference]: Start difference. First operand 212 states and 261 transitions. Second operand has 41 states, 41 states have (on average 2.1707317073170733) internal successors, (89), 38 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:56:54,959 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (= (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|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (and (forall ((v_ArrVal_503 (Array Int Int)) (v_ArrVal_492 (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)) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (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_28| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|))))) is different from false [2021-12-21 17:56:54,966 WARN L838 $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) (= (select .cse1 0) 0) (= (select |c_#valid| |c_sll_append_#in~head#1.base|) 1) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int) (|v_sll_append_sll_create_~new_head~0#1.base_27| 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_28| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_503 (Array Int Int)) (v_ArrVal_492 (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)) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (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_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (= (select .cse0 |c_sll_append_#in~head#1.offset|) 0))) is different from false [2021-12-21 17:56:54,971 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int) (|v_sll_append_sll_create_~new_head~0#1.base_27| 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_28| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_503 (Array Int Int)) (v_ArrVal_492 (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)) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (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_27| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2021-12-21 17:56:54,986 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| 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|)) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_494 (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)) (forall ((v_ArrVal_503 (Array Int Int)) (v_ArrVal_492 (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_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_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 [2021-12-21 17:56:56,990 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| 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|)) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_494 (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)) (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|)))) (= |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 [2021-12-21 17:56:58,994 WARN L838 $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) (|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|)) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_494 (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)) (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 [2021-12-21 17:57:00,997 WARN L838 $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_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) (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|)) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_494 (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)) (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 [2021-12-21 17:57:01,010 WARN L838 $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|)) (and (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)) (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))))) (= (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) (< |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 [2021-12-21 17:57:03,019 WARN L838 $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) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (and (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)) (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 [2021-12-21 17:57:04,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:57:04,450 INFO L93 Difference]: Finished difference Result 264 states and 321 transitions. [2021-12-21 17:57:04,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-21 17:57:04,450 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 [2021-12-21 17:57:04,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:57:04,451 INFO L225 Difference]: With dead ends: 264 [2021-12-21 17:57:04,451 INFO L226 Difference]: Without dead ends: 264 [2021-12-21 17:57:04,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=243, Invalid=1083, Unknown=22, NotChecked=1958, Total=3306 [2021-12-21 17:57:04,452 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 26 mSDsluCounter, 2145 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2241 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 550 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 17:57:04,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 2241 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 334 Invalid, 0 Unknown, 550 Unchecked, 0.2s Time] [2021-12-21 17:57:04,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-12-21 17:57:04,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 243. [2021-12-21 17:57:04,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 199 states have (on average 1.3969849246231156) internal successors, (278), 234 states have internal predecessors, (278), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (11), 4 states have call predecessors, (11), 8 states have call successors, (11) [2021-12-21 17:57:04,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 297 transitions. [2021-12-21 17:57:04,456 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 297 transitions. Word has length 35 [2021-12-21 17:57:04,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:57:04,457 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 297 transitions. [2021-12-21 17:57:04,457 INFO L471 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) [2021-12-21 17:57:04,457 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 297 transitions. [2021-12-21 17:57:04,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-21 17:57:04,457 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:57:04,457 INFO L514 BasicCegarLoop]: 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] [2021-12-21 17:57:04,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-21 17:57:04,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 17:57:04,658 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting sll_appendErr10REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-21 17:57:04,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:57:04,658 INFO L85 PathProgramCache]: Analyzing trace with hash 762522433, now seen corresponding path program 1 times [2021-12-21 17:57:04,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:57:04,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422165807] [2021-12-21 17:57:04,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:57:04,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:57:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:57:04,678 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-21 17:57:04,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:57:04,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422165807] [2021-12-21 17:57:04,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422165807] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:57:04,679 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:57:04,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 17:57:04,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837241960] [2021-12-21 17:57:04,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:57:04,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 17:57:04,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:57:04,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 17:57:04,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 17:57:04,680 INFO L87 Difference]: Start difference. First operand 243 states and 297 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:57:04,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:57:04,686 INFO L93 Difference]: Finished difference Result 247 states and 298 transitions. [2021-12-21 17:57:04,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 17:57:04,687 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 [2021-12-21 17:57:04,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:57:04,688 INFO L225 Difference]: With dead ends: 247 [2021-12-21 17:57:04,688 INFO L226 Difference]: Without dead ends: 247 [2021-12-21 17:57:04,689 INFO L932 BasicCegarLoop]: 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 [2021-12-21 17:57:04,690 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 17:57:04,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 17:57:04,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-12-21 17:57:04,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2021-12-21 17:57:04,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 204 states have (on average 1.3823529411764706) internal successors, (282), 238 states have internal predecessors, (282), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2021-12-21 17:57:04,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 298 transitions. [2021-12-21 17:57:04,695 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 298 transitions. Word has length 35 [2021-12-21 17:57:04,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:57:04,695 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 298 transitions. [2021-12-21 17:57:04,696 INFO L471 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) [2021-12-21 17:57:04,696 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 298 transitions. [2021-12-21 17:57:04,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-21 17:57:04,696 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:57:04,696 INFO L514 BasicCegarLoop]: 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] [2021-12-21 17:57:04,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-21 17:57:04,696 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting sll_appendErr8REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-21 17:57:04,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:57:04,697 INFO L85 PathProgramCache]: Analyzing trace with hash 444674194, now seen corresponding path program 1 times [2021-12-21 17:57:04,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:57:04,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299856752] [2021-12-21 17:57:04,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:57:04,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:57:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:57:04,761 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-21 17:57:04,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:57:04,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299856752] [2021-12-21 17:57:04,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299856752] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 17:57:04,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429760531] [2021-12-21 17:57:04,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:57:04,762 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 17:57:04,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 17:57:04,776 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) [2021-12-21 17:57:04,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-21 17:57:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:57:04,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-21 17:57:04,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 17:57:04,946 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-21 17:57:04,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 17:57:05,025 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-21 17:57:05,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429760531] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 17:57:05,025 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 17:57:05,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-21 17:57:05,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398535875] [2021-12-21 17:57:05,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 17:57:05,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 17:57:05,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:57:05,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 17:57:05,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-21 17:57:05,027 INFO L87 Difference]: Start difference. First operand 247 states and 298 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:57:05,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:57:05,076 INFO L93 Difference]: Finished difference Result 263 states and 306 transitions. [2021-12-21 17:57:05,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 17:57:05,077 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 [2021-12-21 17:57:05,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:57:05,078 INFO L225 Difference]: With dead ends: 263 [2021-12-21 17:57:05,078 INFO L226 Difference]: Without dead ends: 263 [2021-12-21 17:57:05,079 INFO L932 BasicCegarLoop]: 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 [2021-12-21 17:57:05,079 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 197 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 17:57:05,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 905 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 17:57:05,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-12-21 17:57:05,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 255. [2021-12-21 17:57:05,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 212 states have (on average 1.3679245283018868) internal successors, (290), 246 states have internal predecessors, (290), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2021-12-21 17:57:05,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 306 transitions. [2021-12-21 17:57:05,085 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 306 transitions. Word has length 36 [2021-12-21 17:57:05,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:57:05,085 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 306 transitions. [2021-12-21 17:57:05,086 INFO L471 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) [2021-12-21 17:57:05,086 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 306 transitions. [2021-12-21 17:57:05,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-21 17:57:05,086 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:57:05,086 INFO L514 BasicCegarLoop]: 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] [2021-12-21 17:57:05,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-21 17:57:05,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 17:57:05,304 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting sll_appendErr10REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-21 17:57:05,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:57:05,304 INFO L85 PathProgramCache]: Analyzing trace with hash -308582730, now seen corresponding path program 1 times [2021-12-21 17:57:05,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:57:05,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174725087] [2021-12-21 17:57:05,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:57:05,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:57:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:57:05,359 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 17:57:05,359 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:57:05,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174725087] [2021-12-21 17:57:05,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174725087] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 17:57:05,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994783540] [2021-12-21 17:57:05,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:57:05,359 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 17:57:05,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 17:57:05,360 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) [2021-12-21 17:57:05,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-21 17:57:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:57:05,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-21 17:57:05,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 17:57:05,506 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 17:57:05,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 17:57:05,574 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 17:57:05,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994783540] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 17:57:05,575 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 17:57:05,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2021-12-21 17:57:05,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890478196] [2021-12-21 17:57:05,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 17:57:05,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 17:57:05,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:57:05,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 17:57:05,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-21 17:57:05,576 INFO L87 Difference]: Start difference. First operand 255 states and 306 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:57:05,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:57:05,668 INFO L93 Difference]: Finished difference Result 369 states and 428 transitions. [2021-12-21 17:57:05,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 17:57:05,668 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 [2021-12-21 17:57:05,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:57:05,669 INFO L225 Difference]: With dead ends: 369 [2021-12-21 17:57:05,669 INFO L226 Difference]: Without dead ends: 369 [2021-12-21 17:57:05,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2021-12-21 17:57:05,670 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 162 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 17:57:05,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 1160 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 17:57:05,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2021-12-21 17:57:05,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 318. [2021-12-21 17:57:05,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 274 states have (on average 1.3722627737226278) internal successors, (376), 308 states have internal predecessors, (376), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-21 17:57:05,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 390 transitions. [2021-12-21 17:57:05,675 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 390 transitions. Word has length 40 [2021-12-21 17:57:05,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:57:05,675 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 390 transitions. [2021-12-21 17:57:05,676 INFO L471 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) [2021-12-21 17:57:05,676 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 390 transitions. [2021-12-21 17:57:05,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-21 17:57:05,676 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:57:05,676 INFO L514 BasicCegarLoop]: 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] [2021-12-21 17:57:05,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-21 17:57:05,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-21 17:57:05,894 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting sll_appendErr8REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-21 17:57:05,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:57:05,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1726785188, now seen corresponding path program 2 times [2021-12-21 17:57:05,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:57:05,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375817707] [2021-12-21 17:57:05,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:57:05,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:57:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:57:05,986 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-21 17:57:05,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:57:05,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375817707] [2021-12-21 17:57:05,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375817707] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 17:57:05,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411358608] [2021-12-21 17:57:05,986 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 17:57:05,987 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 17:57:05,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 17:57:06,000 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) [2021-12-21 17:57:06,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-21 17:57:06,116 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 17:57:06,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 17:57:06,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-21 17:57:06,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 17:57:06,124 INFO L387 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 [2021-12-21 17:57:06,174 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-21 17:57:06,174 INFO L387 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 [2021-12-21 17:57:06,194 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-21 17:57:06,195 INFO L387 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 [2021-12-21 17:57:06,253 INFO L353 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2021-12-21 17:57:06,254 INFO L387 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 [2021-12-21 17:57:06,313 INFO L353 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2021-12-21 17:57:06,314 INFO L387 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 [2021-12-21 17:57:06,419 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-21 17:57:06,419 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 17:57:06,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411358608] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:57:06,419 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 17:57:06,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 12 [2021-12-21 17:57:06,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831452942] [2021-12-21 17:57:06,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:57:06,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 17:57:06,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:57:06,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 17:57:06,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-12-21 17:57:06,420 INFO L87 Difference]: Start difference. First operand 318 states and 390 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:57:06,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:57:06,487 INFO L93 Difference]: Finished difference Result 342 states and 414 transitions. [2021-12-21 17:57:06,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 17:57:06,488 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 [2021-12-21 17:57:06,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:57:06,489 INFO L225 Difference]: With dead ends: 342 [2021-12-21 17:57:06,489 INFO L226 Difference]: Without dead ends: 342 [2021-12-21 17:57:06,489 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2021-12-21 17:57:06,489 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 164 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 17:57:06,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 328 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 122 Invalid, 0 Unknown, 78 Unchecked, 0.1s Time] [2021-12-21 17:57:06,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-12-21 17:57:06,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 315. [2021-12-21 17:57:06,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 274 states have (on average 1.354014598540146) internal successors, (371), 305 states have internal predecessors, (371), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-21 17:57:06,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 385 transitions. [2021-12-21 17:57:06,494 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 385 transitions. Word has length 44 [2021-12-21 17:57:06,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:57:06,494 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 385 transitions. [2021-12-21 17:57:06,494 INFO L471 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) [2021-12-21 17:57:06,495 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 385 transitions. [2021-12-21 17:57:06,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-21 17:57:06,495 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:57:06,495 INFO L514 BasicCegarLoop]: 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] [2021-12-21 17:57:06,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-21 17:57:06,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-21 17:57:06,712 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting sll_appendErr9REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-21 17:57:06,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:57:06,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1726785189, now seen corresponding path program 1 times [2021-12-21 17:57:06,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:57:06,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389329661] [2021-12-21 17:57:06,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:57:06,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:57:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:57:06,801 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-21 17:57:06,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:57:06,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389329661] [2021-12-21 17:57:06,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389329661] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 17:57:06,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892315836] [2021-12-21 17:57:06,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:57:06,802 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 17:57:06,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 17:57:06,803 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) [2021-12-21 17:57:06,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-21 17:57:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:57:06,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-21 17:57:06,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 17:57:06,910 INFO L387 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 [2021-12-21 17:57:07,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:57:07,022 INFO L387 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 [2021-12-21 17:57:07,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:57:07,048 INFO L387 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 [2021-12-21 17:57:07,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:57:07,073 INFO L387 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 [2021-12-21 17:57:07,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:57:07,099 INFO L387 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 [2021-12-21 17:57:07,145 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-21 17:57:07,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 17:57:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-21 17:57:08,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892315836] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 17:57:08,628 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 17:57:08,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2021-12-21 17:57:08,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093804809] [2021-12-21 17:57:08,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 17:57:08,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-21 17:57:08,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:57:08,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-21 17:57:08,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-12-21 17:57:08,631 INFO L87 Difference]: Start difference. First operand 315 states and 385 transitions. Second operand has 14 states, 13 states have (on average 6.538461538461538) internal successors, (85), 11 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:57:08,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:57:08,745 INFO L93 Difference]: Finished difference Result 339 states and 409 transitions. [2021-12-21 17:57:08,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 17:57:08,746 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.538461538461538) internal successors, (85), 11 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-12-21 17:57:08,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:57:08,747 INFO L225 Difference]: With dead ends: 339 [2021-12-21 17:57:08,747 INFO L226 Difference]: Without dead ends: 339 [2021-12-21 17:57:08,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2021-12-21 17:57:08,748 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 176 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 17:57:08,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 357 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 190 Invalid, 0 Unknown, 112 Unchecked, 0.1s Time] [2021-12-21 17:57:08,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-12-21 17:57:08,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 256. [2021-12-21 17:57:08,751 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) [2021-12-21 17:57:08,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 309 transitions. [2021-12-21 17:57:08,752 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 309 transitions. Word has length 44 [2021-12-21 17:57:08,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:57:08,752 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 309 transitions. [2021-12-21 17:57:08,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.538461538461538) internal successors, (85), 11 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:57:08,752 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 309 transitions. [2021-12-21 17:57:08,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-21 17:57:08,753 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:57:08,753 INFO L514 BasicCegarLoop]: 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] [2021-12-21 17:57:08,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-21 17:57:08,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 17:57:08,963 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting sll_appendErr10REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-21 17:57:08,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:57:08,964 INFO L85 PathProgramCache]: Analyzing trace with hash 685803597, now seen corresponding path program 2 times [2021-12-21 17:57:08,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:57:08,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110220443] [2021-12-21 17:57:08,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:57:08,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:57:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:57:09,188 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-21 17:57:09,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:57:09,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110220443] [2021-12-21 17:57:09,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110220443] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 17:57:09,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60334481] [2021-12-21 17:57:09,188 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 17:57:09,188 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 17:57:09,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 17:57:09,192 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 17:57:09,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-21 17:57:09,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 17:57:09,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 17:57:09,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-21 17:57:09,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 17:57:09,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:57:09,538 INFO L387 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 [2021-12-21 17:57:09,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:57:09,544 INFO L387 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 [2021-12-21 17:57:09,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:57:09,572 INFO L387 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 [2021-12-21 17:57:09,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:57:09,574 INFO L387 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 [2021-12-21 17:57:09,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:57:09,618 INFO L387 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 [2021-12-21 17:57:09,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:57:09,622 INFO L387 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 [2021-12-21 17:57:09,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:57:09,665 INFO L387 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 [2021-12-21 17:57:09,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:57:09,667 INFO L387 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 [2021-12-21 17:57:09,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:57:09,701 INFO L387 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 [2021-12-21 17:57:09,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:57:09,713 INFO L387 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 [2021-12-21 17:57:09,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:57:09,724 INFO L387 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 [2021-12-21 17:57:09,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:57:09,726 INFO L387 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 [2021-12-21 17:57:09,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:57:09,769 INFO L387 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 [2021-12-21 17:57:09,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:57:09,777 INFO L387 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 [2021-12-21 17:57:09,807 INFO L387 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 [2021-12-21 17:57:09,809 INFO L387 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 [2021-12-21 17:57:09,815 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-21 17:57:09,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 17:57:09,833 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1018 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_~new_last~0#1.base| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1017 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_~new_last~0#1.base| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2021-12-21 17:57:09,857 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_~new_last~0#1.base_13| Int)) (or (and (forall ((v_ArrVal_1018 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1017 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (<= |v_sll_append_~new_last~0#1.base_13| |c_sll_append_node_create_with_sublist_#res#1.base|)))) is different from false [2021-12-21 17:57:09,873 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (and (forall ((v_ArrVal_1018 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1017 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-12-21 17:57:09,895 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (and (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-12-21 17:57:10,020 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (and (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-12-21 17:57:12,122 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int)) (or (forall ((|v_sll_append_~new_last~0#1.base_13| Int)) (or (and (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)))) is different from false [2021-12-21 17:57:12,337 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (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_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) is different from false [2021-12-21 17:57:14,593 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= 0 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)))) is different from false [2021-12-21 17:57:14,987 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) is different from false [2021-12-21 17:57:15,426 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_44| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))))) is different from false [2021-12-21 17:57:15,998 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (|v_sll_append_sll_create_~new_head~0#1.base_44| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= 0 (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|)))))) is different from false [2021-12-21 17:57:16,619 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_45| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (|v_sll_append_sll_create_~new_head~0#1.base_44| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (and (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_45| |c_#StackHeapBarrier|)))) is different from false [2021-12-21 17:57:17,743 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (|v_sll_append_sll_create_~new_head~0#1.base_45| Int) (|v_sll_append_sll_create_~new_head~0#1.base_44| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_45| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |v_sll_append_~new_last~0#1.base_13|) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)))) is different from false [2021-12-21 17:57:18,056 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (|v_sll_append_sll_create_~new_head~0#1.base_45| Int) (|v_sll_append_sll_create_~new_head~0#1.base_44| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_45| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |v_sll_append_~new_last~0#1.base_13|) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))))) is different from false [2021-12-21 17:57:20,706 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 28 not checked. [2021-12-21 17:57:20,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60334481] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 17:57:20,706 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 17:57:20,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 19] total 36 [2021-12-21 17:57:20,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832590283] [2021-12-21 17:57:20,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 17:57:20,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-12-21 17:57:20,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:57:20,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-12-21 17:57:20,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=395, Unknown=14, NotChecked=742, Total=1260 [2021-12-21 17:57:20,715 INFO L87 Difference]: Start difference. First operand 256 states and 309 transitions. Second operand has 36 states, 36 states have (on average 2.638888888888889) internal successors, (95), 33 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:57:22,732 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (|v_sll_append_sll_create_~new_head~0#1.base_45| Int) (|v_sll_append_sll_create_~new_head~0#1.base_44| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_45| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |v_sll_append_~new_last~0#1.base_13|) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))))) (= (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 [2021-12-21 17:57:24,744 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_sll_append_#in~head#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_sll_append_#in~head#1.base|) (< |c_#StackHeapBarrier| |c_sll_append_#in~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0) (= (select |c_#valid| |c_sll_append_#in~head#1.base|) 1) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (|v_sll_append_sll_create_~new_head~0#1.base_45| Int) (|v_sll_append_sll_create_~new_head~0#1.base_44| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_45| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |v_sll_append_~new_last~0#1.base_13|) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) is different from false [2021-12-21 17:57:26,748 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_45| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (|v_sll_append_sll_create_~new_head~0#1.base_44| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (and (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_45| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_45| |c_#StackHeapBarrier|))))) is different from false [2021-12-21 17:57:28,799 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_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_44| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2021-12-21 17:57:30,802 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_44| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_44| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int) (|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_44| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2021-12-21 17:57:31,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:57:31,073 INFO L93 Difference]: Finished difference Result 308 states and 370 transitions. [2021-12-21 17:57:31,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-21 17:57:31,073 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.638888888888889) internal successors, (95), 33 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-12-21 17:57:31,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:57:31,074 INFO L225 Difference]: With dead ends: 308 [2021-12-21 17:57:31,074 INFO L226 Difference]: Without dead ends: 308 [2021-12-21 17:57:31,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=164, Invalid=543, Unknown=19, NotChecked=1254, Total=1980 [2021-12-21 17:57:31,075 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 28 mSDsluCounter, 1778 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 540 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 17:57:31,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 1865 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 292 Invalid, 0 Unknown, 540 Unchecked, 0.2s Time] [2021-12-21 17:57:31,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2021-12-21 17:57:31,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 303. [2021-12-21 17:57:31,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 265 states have (on average 1.3169811320754716) internal successors, (349), 293 states have internal predecessors, (349), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2021-12-21 17:57:31,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 365 transitions. [2021-12-21 17:57:31,082 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 365 transitions. Word has length 44 [2021-12-21 17:57:31,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:57:31,082 INFO L470 AbstractCegarLoop]: Abstraction has 303 states and 365 transitions. [2021-12-21 17:57:31,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.638888888888889) internal successors, (95), 33 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:57:31,082 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 365 transitions. [2021-12-21 17:57:31,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-21 17:57:31,083 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:57:31,083 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 17:57:31,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-21 17:57:31,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 17:57:31,293 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting sll_appendErr10REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-21 17:57:31,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:57:31,293 INFO L85 PathProgramCache]: Analyzing trace with hash -686003701, now seen corresponding path program 1 times [2021-12-21 17:57:31,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:57:31,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862340940] [2021-12-21 17:57:31,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:57:31,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:57:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:57:31,312 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-12-21 17:57:31,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:57:31,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862340940] [2021-12-21 17:57:31,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862340940] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:57:31,313 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:57:31,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 17:57:31,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725643776] [2021-12-21 17:57:31,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:57:31,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 17:57:31,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:57:31,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 17:57:31,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 17:57:31,314 INFO L87 Difference]: Start difference. First operand 303 states and 365 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:57:31,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:57:31,327 INFO L93 Difference]: Finished difference Result 398 states and 486 transitions. [2021-12-21 17:57:31,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 17:57:31,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-12-21 17:57:31,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:57:31,330 INFO L225 Difference]: With dead ends: 398 [2021-12-21 17:57:31,330 INFO L226 Difference]: Without dead ends: 398 [2021-12-21 17:57:31,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 17:57:31,331 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 69 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 17:57:31,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 331 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 17:57:31,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-12-21 17:57:31,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 307. [2021-12-21 17:57:31,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 269 states have (on average 1.3011152416356877) internal successors, (350), 297 states have internal predecessors, (350), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2021-12-21 17:57:31,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 366 transitions. [2021-12-21 17:57:31,338 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 366 transitions. Word has length 44 [2021-12-21 17:57:31,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:57:31,339 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 366 transitions. [2021-12-21 17:57:31,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:57:31,339 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 366 transitions. [2021-12-21 17:57:31,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-21 17:57:31,339 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:57:31,339 INFO L514 BasicCegarLoop]: 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] [2021-12-21 17:57:31,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-21 17:57:31,340 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting sll_appendErr10REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-21 17:57:31,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:57:31,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1834257435, now seen corresponding path program 1 times [2021-12-21 17:57:31,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:57:31,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165865945] [2021-12-21 17:57:31,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:57:31,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:57:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:57:31,581 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-21 17:57:31,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:57:31,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165865945] [2021-12-21 17:57:31,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165865945] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 17:57:31,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827752889] [2021-12-21 17:57:31,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:57:31,582 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 17:57:31,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 17:57:31,583 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 17:57:31,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-21 17:57:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:57:31,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 57 conjunts are in the unsatisfiable core [2021-12-21 17:57:31,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 17:57:31,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:57:31,973 INFO L387 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 [2021-12-21 17:57:31,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:57:31,976 INFO L387 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 [2021-12-21 17:57:32,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:57:32,089 INFO L387 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 [2021-12-21 17:57:32,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:57:32,093 INFO L387 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 [2021-12-21 17:57:32,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:57:32,195 INFO L387 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 [2021-12-21 17:57:32,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:57:32,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:57:32,214 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-21 17:57:32,215 INFO L387 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 [2021-12-21 17:57:32,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:57:32,282 INFO L387 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 [2021-12-21 17:57:32,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:57:32,303 INFO L387 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 [2021-12-21 17:57:32,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:57:32,321 INFO L387 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 [2021-12-21 17:57:32,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:57:32,326 INFO L387 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 [2021-12-21 17:57:32,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:57:32,392 INFO L387 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 [2021-12-21 17:57:32,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 17:57:32,395 INFO L387 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 [2021-12-21 17:57:32,419 INFO L387 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 [2021-12-21 17:57:32,421 INFO L387 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 [2021-12-21 17:57:32,428 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-21 17:57:32,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 17:57:32,445 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1176 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_~new_last~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_~new_last~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2021-12-21 17:57:32,451 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_#res#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1176 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_#res#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2021-12-21 17:57:32,458 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1176 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2021-12-21 17:57:32,497 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2021-12-21 17:57:32,523 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-12-21 17:57:32,565 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-12-21 17:57:32,666 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_49| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-12-21 17:57:32,755 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_49| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-12-21 17:57:32,895 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_49| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= 0 (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1165))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|))) (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-12-21 17:57:33,116 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_50| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_49| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_1165))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_50| |c_#StackHeapBarrier|)))) is different from false [2021-12-21 17:57:33,508 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_50| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_49| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1177) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_1165))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1176) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_50| |c_#StackHeapBarrier|)))) is different from false [2021-12-21 17:57:35,662 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_50| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_49| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_1165))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1176) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1177) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_50| |c_#StackHeapBarrier|)))) is different from false [2021-12-21 17:57:38,027 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 15 not checked. [2021-12-21 17:57:38,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827752889] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 17:57:38,027 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 17:57:38,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 17] total 38 [2021-12-21 17:57:38,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596237410] [2021-12-21 17:57:38,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 17:57:38,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-21 17:57:38,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:57:38,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-21 17:57:38,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=544, Unknown=12, NotChecked=708, Total=1406 [2021-12-21 17:57:38,029 INFO L87 Difference]: Start difference. First operand 307 states and 366 transitions. Second operand has 38 states, 38 states have (on average 2.5) internal successors, (95), 35 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:57:40,036 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_50| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_49| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_1165))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1176) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1177) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_50| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#head~1#1.base|)) is different from false [2021-12-21 17:57:40,072 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (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) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_50| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_49| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1177) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_1165))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1176) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_50| |c_#StackHeapBarrier|)))) (<= (+ |c_#StackHeapBarrier| 1) |c_sll_append_#in~head#1.base|) (< |c_#StackHeapBarrier| |c_sll_append_#in~head#1.base|) (= (select .cse2 |c_sll_append_#in~head#1.offset|) 0) (= (select .cse2 0) 0) (= (select |c_#valid| |c_sll_append_#in~head#1.base|) 1) (= (select .cse0 |c_sll_append_#in~head#1.offset|) 0))) is different from false [2021-12-21 17:57:42,076 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_50| Int) (|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_49| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_50| v_ArrVal_1165))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_50| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2021-12-21 17:57:44,079 WARN L838 $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_49| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_49| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= 0 (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1165))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|))) (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |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 [2021-12-21 17:57:46,085 WARN L838 $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_49| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_49| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) (< |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 [2021-12-21 17:57:48,089 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_49| Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_49| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_49| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_49| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_49|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) (< |c_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 [2021-12-21 17:57:48,098 WARN L838 $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_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2021-12-21 17:57:48,106 WARN L838 $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_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (and (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (exists ((|sll_append_sll_create_~new_head~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) 0) 0) (< |sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2021-12-21 17:57:48,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:57:48,432 INFO L93 Difference]: Finished difference Result 356 states and 418 transitions. [2021-12-21 17:57:48,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-21 17:57:48,432 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.5) internal successors, (95), 35 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-12-21 17:57:48,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:57:48,433 INFO L225 Difference]: With dead ends: 356 [2021-12-21 17:57:48,433 INFO L226 Difference]: Without dead ends: 356 [2021-12-21 17:57:48,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=222, Invalid=960, Unknown=20, NotChecked=1660, Total=2862 [2021-12-21 17:57:48,434 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 27 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1878 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 551 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 17:57:48,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 1878 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 302 Invalid, 0 Unknown, 551 Unchecked, 0.1s Time] [2021-12-21 17:57:48,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2021-12-21 17:57:48,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 337. [2021-12-21 17:57:48,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 297 states have (on average 1.2760942760942762) internal successors, (379), 326 states have internal predecessors, (379), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 4 states have call predecessors, (11), 8 states have call successors, (11) [2021-12-21 17:57:48,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 398 transitions. [2021-12-21 17:57:48,440 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 398 transitions. Word has length 47 [2021-12-21 17:57:48,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:57:48,440 INFO L470 AbstractCegarLoop]: Abstraction has 337 states and 398 transitions. [2021-12-21 17:57:48,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.5) internal successors, (95), 35 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 17:57:48,440 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 398 transitions. [2021-12-21 17:57:48,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-21 17:57:48,440 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:57:48,440 INFO L514 BasicCegarLoop]: 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] [2021-12-21 17:57:48,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-21 17:57:48,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-21 17:57:48,658 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-21 17:57:48,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:57:48,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1659810607, now seen corresponding path program 1 times [2021-12-21 17:57:48,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:57:48,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918063000] [2021-12-21 17:57:48,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:57:48,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:57:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:57:48,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 17:57:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:57:48,715 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-21 17:57:48,715 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:57:48,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918063000] [2021-12-21 17:57:48,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918063000] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:57:48,716 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:57:48,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 17:57:48,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739953378] [2021-12-21 17:57:48,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:57:48,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 17:57:48,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:57:48,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 17:57:48,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 17:57:48,717 INFO L87 Difference]: Start difference. First operand 337 states and 398 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 17:57:48,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:57:48,793 INFO L93 Difference]: Finished difference Result 393 states and 460 transitions. [2021-12-21 17:57:48,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 17:57:48,794 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 [2021-12-21 17:57:48,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:57:48,795 INFO L225 Difference]: With dead ends: 393 [2021-12-21 17:57:48,795 INFO L226 Difference]: Without dead ends: 393 [2021-12-21 17:57:48,795 INFO L932 BasicCegarLoop]: 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 [2021-12-21 17:57:48,795 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 192 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 17:57:48,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 288 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 17:57:48,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2021-12-21 17:57:48,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 337. [2021-12-21 17:57:48,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 297 states have (on average 1.2760942760942762) internal successors, (379), 326 states have internal predecessors, (379), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 4 states have call predecessors, (11), 8 states have call successors, (11) [2021-12-21 17:57:48,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 398 transitions. [2021-12-21 17:57:48,801 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 398 transitions. Word has length 54 [2021-12-21 17:57:48,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:57:48,801 INFO L470 AbstractCegarLoop]: Abstraction has 337 states and 398 transitions. [2021-12-21 17:57:48,801 INFO L471 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) [2021-12-21 17:57:48,802 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 398 transitions. [2021-12-21 17:57:48,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-21 17:57:48,802 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:57:48,802 INFO L514 BasicCegarLoop]: 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] [2021-12-21 17:57:48,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-21 17:57:48,802 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-21 17:57:48,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:57:48,803 INFO L85 PathProgramCache]: Analyzing trace with hash -85479915, now seen corresponding path program 1 times [2021-12-21 17:57:48,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:57:48,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836778288] [2021-12-21 17:57:48,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:57:48,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:57:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:57:48,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 17:57:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:57:48,911 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-21 17:57:48,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:57:48,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836778288] [2021-12-21 17:57:48,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836778288] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:57:48,912 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:57:48,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 17:57:48,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772767713] [2021-12-21 17:57:48,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:57:48,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 17:57:48,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:57:48,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 17:57:48,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-21 17:57:48,913 INFO L87 Difference]: Start difference. First operand 337 states and 398 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 17:57:49,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:57:49,195 INFO L93 Difference]: Finished difference Result 547 states and 660 transitions. [2021-12-21 17:57:49,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 17:57:49,195 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 [2021-12-21 17:57:49,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:57:49,197 INFO L225 Difference]: With dead ends: 547 [2021-12-21 17:57:49,197 INFO L226 Difference]: Without dead ends: 547 [2021-12-21 17:57:49,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2021-12-21 17:57:49,198 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 281 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 17:57:49,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 642 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 17:57:49,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2021-12-21 17:57:49,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 350. [2021-12-21 17:57:49,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 311 states have (on average 1.2861736334405145) internal successors, (400), 338 states have internal predecessors, (400), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 5 states have call predecessors, (11), 8 states have call successors, (11) [2021-12-21 17:57:49,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 419 transitions. [2021-12-21 17:57:49,205 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 419 transitions. Word has length 55 [2021-12-21 17:57:49,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:57:49,205 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 419 transitions. [2021-12-21 17:57:49,206 INFO L471 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) [2021-12-21 17:57:49,206 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 419 transitions. [2021-12-21 17:57:49,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-21 17:57:49,206 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:57:49,206 INFO L514 BasicCegarLoop]: 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] [2021-12-21 17:57:49,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-21 17:57:49,207 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-21 17:57:49,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:57:49,207 INFO L85 PathProgramCache]: Analyzing trace with hash -85479914, now seen corresponding path program 1 times [2021-12-21 17:57:49,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:57:49,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072695066] [2021-12-21 17:57:49,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:57:49,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:57:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:57:49,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 17:57:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:57:49,378 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-21 17:57:49,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:57:49,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072695066] [2021-12-21 17:57:49,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072695066] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:57:49,378 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:57:49,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 17:57:49,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114550010] [2021-12-21 17:57:49,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:57:49,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 17:57:49,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:57:49,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 17:57:49,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-21 17:57:49,380 INFO L87 Difference]: Start difference. First operand 350 states and 419 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 17:57:49,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:57:49,671 INFO L93 Difference]: Finished difference Result 556 states and 686 transitions. [2021-12-21 17:57:49,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 17:57:49,671 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 [2021-12-21 17:57:49,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:57:49,673 INFO L225 Difference]: With dead ends: 556 [2021-12-21 17:57:49,673 INFO L226 Difference]: Without dead ends: 556 [2021-12-21 17:57:49,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2021-12-21 17:57:49,673 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 273 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 17:57:49,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 658 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 17:57:49,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2021-12-21 17:57:49,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 386. [2021-12-21 17:57:49,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 347 states have (on average 1.3112391930835734) internal successors, (455), 374 states have internal predecessors, (455), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 5 states have call predecessors, (11), 8 states have call successors, (11) [2021-12-21 17:57:49,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 474 transitions. [2021-12-21 17:57:49,680 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 474 transitions. Word has length 55 [2021-12-21 17:57:49,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:57:49,680 INFO L470 AbstractCegarLoop]: Abstraction has 386 states and 474 transitions. [2021-12-21 17:57:49,681 INFO L471 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) [2021-12-21 17:57:49,681 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 474 transitions. [2021-12-21 17:57:49,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-21 17:57:49,681 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:57:49,681 INFO L514 BasicCegarLoop]: 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] [2021-12-21 17:57:49,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-21 17:57:49,682 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-21 17:57:49,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:57:49,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1645084350, now seen corresponding path program 1 times [2021-12-21 17:57:49,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:57:49,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792933725] [2021-12-21 17:57:49,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:57:49,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:57:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:57:49,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 17:57:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:57:49,759 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-21 17:57:49,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:57:49,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792933725] [2021-12-21 17:57:49,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792933725] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:57:49,760 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:57:49,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 17:57:49,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174337832] [2021-12-21 17:57:49,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:57:49,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 17:57:49,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:57:49,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 17:57:49,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-21 17:57:49,762 INFO L87 Difference]: Start difference. First operand 386 states and 474 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 17:57:49,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:57:49,902 INFO L93 Difference]: Finished difference Result 441 states and 545 transitions. [2021-12-21 17:57:49,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 17:57:49,903 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2021-12-21 17:57:49,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:57:49,904 INFO L225 Difference]: With dead ends: 441 [2021-12-21 17:57:49,904 INFO L226 Difference]: Without dead ends: 441 [2021-12-21 17:57:49,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-12-21 17:57:49,904 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 48 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 17:57:49,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 601 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 17:57:49,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2021-12-21 17:57:49,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 421. [2021-12-21 17:57:49,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 382 states have (on average 1.3350785340314135) internal successors, (510), 409 states have internal predecessors, (510), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 5 states have call predecessors, (11), 8 states have call successors, (11) [2021-12-21 17:57:49,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 529 transitions. [2021-12-21 17:57:49,910 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 529 transitions. Word has length 56 [2021-12-21 17:57:49,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:57:49,910 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 529 transitions. [2021-12-21 17:57:49,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 17:57:49,910 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 529 transitions. [2021-12-21 17:57:49,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-21 17:57:49,911 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:57:49,911 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 17:57:49,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-21 17:57:49,911 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-21 17:57:49,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:57:49,912 INFO L85 PathProgramCache]: Analyzing trace with hash -541993187, now seen corresponding path program 1 times [2021-12-21 17:57:49,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:57:49,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699666806] [2021-12-21 17:57:49,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:57:49,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:57:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:57:49,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 17:57:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:57:50,007 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-21 17:57:50,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:57:50,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699666806] [2021-12-21 17:57:50,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699666806] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:57:50,008 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:57:50,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 17:57:50,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950428008] [2021-12-21 17:57:50,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:57:50,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 17:57:50,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:57:50,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 17:57:50,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-21 17:57:50,009 INFO L87 Difference]: Start difference. First operand 421 states and 529 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 17:57:50,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:57:50,224 INFO L93 Difference]: Finished difference Result 560 states and 704 transitions. [2021-12-21 17:57:50,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 17:57:50,225 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2021-12-21 17:57:50,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:57:50,226 INFO L225 Difference]: With dead ends: 560 [2021-12-21 17:57:50,226 INFO L226 Difference]: Without dead ends: 560 [2021-12-21 17:57:50,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2021-12-21 17:57:50,227 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 179 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 17:57:50,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 769 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 17:57:50,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2021-12-21 17:57:50,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 421. [2021-12-21 17:57:50,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 382 states have (on average 1.3219895287958114) internal successors, (505), 409 states have internal predecessors, (505), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 5 states have call predecessors, (11), 8 states have call successors, (11) [2021-12-21 17:57:50,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 524 transitions. [2021-12-21 17:57:50,234 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 524 transitions. Word has length 57 [2021-12-21 17:57:50,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:57:50,234 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 524 transitions. [2021-12-21 17:57:50,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 17:57:50,234 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 524 transitions. [2021-12-21 17:57:50,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-21 17:57:50,235 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:57:50,235 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 17:57:50,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-21 17:57:50,235 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-21 17:57:50,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:57:50,236 INFO L85 PathProgramCache]: Analyzing trace with hash 383583177, now seen corresponding path program 1 times [2021-12-21 17:57:50,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:57:50,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702956286] [2021-12-21 17:57:50,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:57:50,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:57:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:57:50,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 17:57:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:57:50,630 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-21 17:57:50,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:57:50,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702956286] [2021-12-21 17:57:50,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702956286] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:57:50,630 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:57:50,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-12-21 17:57:50,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084524979] [2021-12-21 17:57:50,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:57:50,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-21 17:57:50,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:57:50,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-21 17:57:50,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2021-12-21 17:57:50,631 INFO L87 Difference]: Start difference. First operand 421 states and 524 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 17:57:51,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:57:51,448 INFO L93 Difference]: Finished difference Result 703 states and 878 transitions. [2021-12-21 17:57:51,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-21 17:57:51,449 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2021-12-21 17:57:51,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:57:51,450 INFO L225 Difference]: With dead ends: 703 [2021-12-21 17:57:51,450 INFO L226 Difference]: Without dead ends: 703 [2021-12-21 17:57:51,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=205, Invalid=1277, Unknown=0, NotChecked=0, Total=1482 [2021-12-21 17:57:51,451 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 592 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-21 17:57:51,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [592 Valid, 1086 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-21 17:57:51,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2021-12-21 17:57:51,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 458. [2021-12-21 17:57:51,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 419 states have (on average 1.331742243436754) internal successors, (558), 445 states have internal predecessors, (558), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 6 states have call predecessors, (11), 8 states have call successors, (11) [2021-12-21 17:57:51,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 577 transitions. [2021-12-21 17:57:51,459 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 577 transitions. Word has length 58 [2021-12-21 17:57:51,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:57:51,459 INFO L470 AbstractCegarLoop]: Abstraction has 458 states and 577 transitions. [2021-12-21 17:57:51,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 17:57:51,460 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 577 transitions. [2021-12-21 17:57:51,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-21 17:57:51,460 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:57:51,460 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 17:57:51,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-21 17:57:51,460 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-12-21 17:57:51,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:57:51,461 INFO L85 PathProgramCache]: Analyzing trace with hash 383583178, now seen corresponding path program 1 times [2021-12-21 17:57:51,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:57:51,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275787132] [2021-12-21 17:57:51,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:57:51,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:57:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:57:51,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-21 17:57:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:57:51,847 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-21 17:57:51,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:57:51,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275787132] [2021-12-21 17:57:51,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275787132] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:57:51,847 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:57:51,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-12-21 17:57:51,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607344533] [2021-12-21 17:57:51,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:57:51,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-21 17:57:51,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:57:51,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-21 17:57:51,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-12-21 17:57:51,848 INFO L87 Difference]: Start difference. First operand 458 states and 577 transitions. Second operand has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)