./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 791161d1 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-?-791161d [2022-07-23 05:27:17,084 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 05:27:17,086 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 05:27:17,124 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 05:27:17,124 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 05:27:17,126 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 05:27:17,127 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 05:27:17,129 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 05:27:17,130 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 05:27:17,134 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 05:27:17,135 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 05:27:17,137 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 05:27:17,137 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 05:27:17,138 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 05:27:17,139 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 05:27:17,142 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 05:27:17,143 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 05:27:17,144 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 05:27:17,145 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 05:27:17,149 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 05:27:17,151 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 05:27:17,152 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 05:27:17,152 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 05:27:17,153 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 05:27:17,154 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 05:27:17,159 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 05:27:17,159 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 05:27:17,159 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 05:27:17,160 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 05:27:17,161 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 05:27:17,161 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 05:27:17,162 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 05:27:17,163 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 05:27:17,163 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 05:27:17,164 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 05:27:17,164 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 05:27:17,164 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 05:27:17,165 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 05:27:17,165 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 05:27:17,165 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 05:27:17,166 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 05:27:17,167 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 05:27:17,169 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-07-23 05:27:17,194 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 05:27:17,195 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 05:27:17,195 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 05:27:17,195 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 05:27:17,196 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 05:27:17,196 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 05:27:17,196 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 05:27:17,197 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 05:27:17,197 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 05:27:17,197 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 05:27:17,198 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 05:27:17,198 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 05:27:17,198 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 05:27:17,198 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 05:27:17,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 05:27:17,198 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 05:27:17,198 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 05:27:17,198 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 05:27:17,199 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 05:27:17,200 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 05:27:17,200 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 05:27:17,200 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 05:27:17,200 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 05:27:17,200 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 05:27:17,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 05:27:17,200 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 05:27:17,201 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 05:27:17,201 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 05:27:17,201 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 05:27:17,201 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 68e1c5cf050539b3ee8f058d38ff7af5aea2a400d05e41e0185e4509f45301e0 [2022-07-23 05:27:17,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 05:27:17,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 05:27:17,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 05:27:17,443 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 05:27:17,443 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 05:27:17,445 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i [2022-07-23 05:27:17,491 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/391485e37/40f6f0f922084c959133e283486cbc07/FLAG3003ee94e [2022-07-23 05:27:17,868 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 05:27:17,868 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i [2022-07-23 05:27:17,876 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/391485e37/40f6f0f922084c959133e283486cbc07/FLAG3003ee94e [2022-07-23 05:27:18,234 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/391485e37/40f6f0f922084c959133e283486cbc07 [2022-07-23 05:27:18,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 05:27:18,237 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 05:27:18,238 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 05:27:18,238 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 05:27:18,240 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 05:27:18,241 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:27:18" (1/1) ... [2022-07-23 05:27:18,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@495b257a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:27:18, skipping insertion in model container [2022-07-23 05:27:18,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:27:18" (1/1) ... [2022-07-23 05:27:18,246 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 05:27:18,265 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 05:27:18,433 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i[25013,25026] [2022-07-23 05:27:18,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:27:18,439 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 05:27:18,466 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i[25013,25026] [2022-07-23 05:27:18,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:27:18,488 INFO L208 MainTranslator]: Completed translation [2022-07-23 05:27:18,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:27:18 WrapperNode [2022-07-23 05:27:18,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 05:27:18,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 05:27:18,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 05:27:18,489 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 05:27:18,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:27:18" (1/1) ... [2022-07-23 05:27:18,502 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:27:18" (1/1) ... [2022-07-23 05:27:18,516 INFO L137 Inliner]: procedures = 129, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 186 [2022-07-23 05:27:18,516 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 05:27:18,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 05:27:18,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 05:27:18,517 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 05:27:18,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:27:18" (1/1) ... [2022-07-23 05:27:18,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:27:18" (1/1) ... [2022-07-23 05:27:18,524 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:27:18" (1/1) ... [2022-07-23 05:27:18,525 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:27:18" (1/1) ... [2022-07-23 05:27:18,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:27:18" (1/1) ... [2022-07-23 05:27:18,532 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:27:18" (1/1) ... [2022-07-23 05:27:18,533 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:27:18" (1/1) ... [2022-07-23 05:27:18,535 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 05:27:18,535 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 05:27:18,535 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 05:27:18,535 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 05:27:18,536 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:27:18" (1/1) ... [2022-07-23 05:27:18,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 05:27:18,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:27:18,558 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-23 05:27:18,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-23 05:27:18,582 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-23 05:27:18,582 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-23 05:27:18,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 05:27:18,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 05:27:18,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 05:27:18,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 05:27:18,582 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2022-07-23 05:27:18,583 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2022-07-23 05:27:18,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 05:27:18,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 05:27:18,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 05:27:18,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 05:27:18,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 05:27:18,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 05:27:18,658 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 05:27:18,659 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 05:27:18,690 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-23 05:27:18,875 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 05:27:18,880 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 05:27:18,880 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-07-23 05:27:18,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 05:27:18 BoogieIcfgContainer [2022-07-23 05:27:18,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 05:27:18,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 05:27:18,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 05:27:18,896 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 05:27:18,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 05:27:18" (1/3) ... [2022-07-23 05:27:18,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec5de28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 05:27:18, skipping insertion in model container [2022-07-23 05:27:18,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:27:18" (2/3) ... [2022-07-23 05:27:18,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec5de28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 05:27:18, skipping insertion in model container [2022-07-23 05:27:18,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 05:27:18" (3/3) ... [2022-07-23 05:27:18,898 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-2.i [2022-07-23 05:27:18,908 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 05:27:18,908 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2022-07-23 05:27:18,960 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 05:27:18,967 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@32c3a47c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@10ba9534 [2022-07-23 05:27:18,967 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2022-07-23 05:27:18,971 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 73 states have (on average 1.9315068493150684) internal successors, (141), 116 states have internal predecessors, (141), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 05:27:18,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 05:27:18,980 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:27:18,980 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:27:18,981 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 05:27:18,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:27:18,986 INFO L85 PathProgramCache]: Analyzing trace with hash -46006015, now seen corresponding path program 1 times [2022-07-23 05:27:18,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:27:18,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605019698] [2022-07-23 05:27:18,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:27:18,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:27:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:27:19,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:27:19,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:27:19,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605019698] [2022-07-23 05:27:19,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605019698] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:27:19,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:27:19,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:27:19,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001016641] [2022-07-23 05:27:19,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:27:19,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:27:19,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:27:19,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:27:19,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:27:19,192 INFO L87 Difference]: Start difference. First operand has 121 states, 73 states have (on average 1.9315068493150684) internal successors, (141), 116 states have internal predecessors, (141), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:19,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:27:19,249 INFO L93 Difference]: Finished difference Result 128 states and 147 transitions. [2022-07-23 05:27:19,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:27:19,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-23 05:27:19,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:27:19,260 INFO L225 Difference]: With dead ends: 128 [2022-07-23 05:27:19,260 INFO L226 Difference]: Without dead ends: 122 [2022-07-23 05:27:19,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:27:19,266 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 7 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:27:19,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 258 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:27:19,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-23 05:27:19,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 116. [2022-07-23 05:27:19,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 71 states have (on average 1.7746478873239437) internal successors, (126), 112 states have internal predecessors, (126), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 05:27:19,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 130 transitions. [2022-07-23 05:27:19,306 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 130 transitions. Word has length 10 [2022-07-23 05:27:19,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:27:19,306 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 130 transitions. [2022-07-23 05:27:19,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:19,307 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 130 transitions. [2022-07-23 05:27:19,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-23 05:27:19,307 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:27:19,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:27:19,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 05:27:19,308 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 05:27:19,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:27:19,309 INFO L85 PathProgramCache]: Analyzing trace with hash 244152622, now seen corresponding path program 1 times [2022-07-23 05:27:19,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:27:19,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008835175] [2022-07-23 05:27:19,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:27:19,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:27:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:27:19,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:27:19,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:27:19,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008835175] [2022-07-23 05:27:19,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008835175] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:27:19,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:27:19,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:27:19,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990053148] [2022-07-23 05:27:19,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:27:19,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:27:19,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:27:19,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:27:19,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:27:19,377 INFO L87 Difference]: Start difference. First operand 116 states and 130 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:19,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:27:19,489 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2022-07-23 05:27:19,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:27:19,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-23 05:27:19,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:27:19,492 INFO L225 Difference]: With dead ends: 151 [2022-07-23 05:27:19,492 INFO L226 Difference]: Without dead ends: 151 [2022-07-23 05:27:19,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:27:19,493 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 40 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:27:19,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 234 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:27:19,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-23 05:27:19,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 115. [2022-07-23 05:27:19,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 71 states have (on average 1.7605633802816902) internal successors, (125), 111 states have internal predecessors, (125), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 05:27:19,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2022-07-23 05:27:19,500 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 13 [2022-07-23 05:27:19,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:27:19,500 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2022-07-23 05:27:19,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:19,500 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2022-07-23 05:27:19,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-23 05:27:19,501 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:27:19,501 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:27:19,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 05:27:19,501 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 05:27:19,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:27:19,502 INFO L85 PathProgramCache]: Analyzing trace with hash 244152621, now seen corresponding path program 1 times [2022-07-23 05:27:19,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:27:19,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580346607] [2022-07-23 05:27:19,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:27:19,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:27:19,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:27:19,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:27:19,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:27:19,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580346607] [2022-07-23 05:27:19,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580346607] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:27:19,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:27:19,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:27:19,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825371783] [2022-07-23 05:27:19,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:27:19,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:27:19,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:27:19,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:27:19,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:27:19,535 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:19,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:27:19,603 INFO L93 Difference]: Finished difference Result 150 states and 168 transitions. [2022-07-23 05:27:19,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:27:19,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-23 05:27:19,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:27:19,608 INFO L225 Difference]: With dead ends: 150 [2022-07-23 05:27:19,609 INFO L226 Difference]: Without dead ends: 150 [2022-07-23 05:27:19,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:27:19,611 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 39 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:27:19,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 228 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:27:19,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-23 05:27:19,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 114. [2022-07-23 05:27:19,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 71 states have (on average 1.7464788732394365) internal successors, (124), 110 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 05:27:19,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2022-07-23 05:27:19,628 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 13 [2022-07-23 05:27:19,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:27:19,628 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2022-07-23 05:27:19,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:19,629 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2022-07-23 05:27:19,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-23 05:27:19,629 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:27:19,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:27:19,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 05:27:19,630 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 05:27:19,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:27:19,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1021253985, now seen corresponding path program 1 times [2022-07-23 05:27:19,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:27:19,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302202293] [2022-07-23 05:27:19,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:27:19,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:27:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:27:19,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:27:19,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:27:19,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302202293] [2022-07-23 05:27:19,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302202293] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:27:19,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:27:19,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:27:19,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748192225] [2022-07-23 05:27:19,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:27:19,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:27:19,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:27:19,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:27:19,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:27:19,671 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:19,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:27:19,713 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2022-07-23 05:27:19,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:27:19,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-23 05:27:19,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:27:19,714 INFO L225 Difference]: With dead ends: 112 [2022-07-23 05:27:19,714 INFO L226 Difference]: Without dead ends: 112 [2022-07-23 05:27:19,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:27:19,715 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 35 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:27:19,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 162 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:27:19,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-23 05:27:19,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-07-23 05:27:19,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 71 states have (on average 1.7183098591549295) internal successors, (122), 108 states have internal predecessors, (122), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 05:27:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2022-07-23 05:27:19,720 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 14 [2022-07-23 05:27:19,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:27:19,720 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2022-07-23 05:27:19,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:19,721 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2022-07-23 05:27:19,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-23 05:27:19,721 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:27:19,721 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:27:19,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 05:27:19,722 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting sll_appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 05:27:19,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:27:19,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1021253984, now seen corresponding path program 1 times [2022-07-23 05:27:19,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:27:19,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747638441] [2022-07-23 05:27:19,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:27:19,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:27:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:27:19,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:27:19,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:27:19,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747638441] [2022-07-23 05:27:19,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747638441] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:27:19,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:27:19,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 05:27:19,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216353299] [2022-07-23 05:27:19,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:27:19,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:27:19,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:27:19,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:27:19,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:27:19,810 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:19,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:27:19,908 INFO L93 Difference]: Finished difference Result 213 states and 236 transitions. [2022-07-23 05:27:19,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 05:27:19,909 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-23 05:27:19,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:27:19,910 INFO L225 Difference]: With dead ends: 213 [2022-07-23 05:27:19,910 INFO L226 Difference]: Without dead ends: 213 [2022-07-23 05:27:19,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-23 05:27:19,918 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 160 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:27:19,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 889 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:27:19,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-07-23 05:27:19,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 139. [2022-07-23 05:27:19,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 97 states have (on average 1.7010309278350515) internal successors, (165), 134 states have internal predecessors, (165), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-23 05:27:19,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 169 transitions. [2022-07-23 05:27:19,931 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 169 transitions. Word has length 14 [2022-07-23 05:27:19,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:27:19,931 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 169 transitions. [2022-07-23 05:27:19,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:19,931 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 169 transitions. [2022-07-23 05:27:19,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-23 05:27:19,932 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:27:19,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:27:19,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 05:27:19,932 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting sll_appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 05:27:19,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:27:19,933 INFO L85 PathProgramCache]: Analyzing trace with hash -790832604, now seen corresponding path program 1 times [2022-07-23 05:27:19,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:27:19,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222479143] [2022-07-23 05:27:19,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:27:19,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:27:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:27:19,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:27:19,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:27:19,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222479143] [2022-07-23 05:27:19,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222479143] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:27:19,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481015970] [2022-07-23 05:27:19,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:27:19,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:27:19,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:27:19,963 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:27:19,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-23 05:27:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:27:20,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 05:27:20,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:27:20,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:27:20,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:27:20,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:27:20,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481015970] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:27:20,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:27:20,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-23 05:27:20,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94324585] [2022-07-23 05:27:20,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:27:20,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 05:27:20,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:27:20,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 05:27:20,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:27:20,202 INFO L87 Difference]: Start difference. First operand 139 states and 169 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:20,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:27:20,248 INFO L93 Difference]: Finished difference Result 192 states and 229 transitions. [2022-07-23 05:27:20,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 05:27:20,249 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-23 05:27:20,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:27:20,250 INFO L225 Difference]: With dead ends: 192 [2022-07-23 05:27:20,250 INFO L226 Difference]: Without dead ends: 192 [2022-07-23 05:27:20,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:27:20,256 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 91 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:27:20,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 515 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:27:20,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-23 05:27:20,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 156. [2022-07-23 05:27:20,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 112 states have (on average 1.6517857142857142) internal successors, (185), 149 states have internal predecessors, (185), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 05:27:20,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 193 transitions. [2022-07-23 05:27:20,276 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 193 transitions. Word has length 16 [2022-07-23 05:27:20,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:27:20,277 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 193 transitions. [2022-07-23 05:27:20,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:20,277 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 193 transitions. [2022-07-23 05:27:20,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-23 05:27:20,278 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:27:20,278 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:27:20,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-23 05:27:20,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-23 05:27:20,495 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting sll_appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 05:27:20,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:27:20,495 INFO L85 PathProgramCache]: Analyzing trace with hash -924446423, now seen corresponding path program 1 times [2022-07-23 05:27:20,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:27:20,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476678089] [2022-07-23 05:27:20,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:27:20,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:27:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:27:20,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:27:20,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:27:20,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476678089] [2022-07-23 05:27:20,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476678089] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:27:20,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953599166] [2022-07-23 05:27:20,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:27:20,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:27:20,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:27:20,556 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:27:20,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-23 05:27:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:27:20,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-23 05:27:20,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:27:20,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:27:20,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:27:20,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:27:20,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953599166] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:27:20,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:27:20,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-23 05:27:20,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735287747] [2022-07-23 05:27:20,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:27:20,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 05:27:20,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:27:20,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 05:27:20,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-23 05:27:20,732 INFO L87 Difference]: Start difference. First operand 156 states and 193 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:20,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:27:20,833 INFO L93 Difference]: Finished difference Result 238 states and 269 transitions. [2022-07-23 05:27:20,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 05:27:20,834 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-23 05:27:20,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:27:20,835 INFO L225 Difference]: With dead ends: 238 [2022-07-23 05:27:20,835 INFO L226 Difference]: Without dead ends: 238 [2022-07-23 05:27:20,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-07-23 05:27:20,836 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 291 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:27:20,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 1261 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:27:20,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-07-23 05:27:20,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 164. [2022-07-23 05:27:20,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 120 states have (on average 1.6083333333333334) internal successors, (193), 157 states have internal predecessors, (193), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 05:27:20,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 201 transitions. [2022-07-23 05:27:20,841 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 201 transitions. Word has length 18 [2022-07-23 05:27:20,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:27:20,841 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 201 transitions. [2022-07-23 05:27:20,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:20,841 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 201 transitions. [2022-07-23 05:27:20,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-23 05:27:20,842 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:27:20,842 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:27:20,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-23 05:27:21,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-07-23 05:27:21,056 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting sll_appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 05:27:21,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:27:21,057 INFO L85 PathProgramCache]: Analyzing trace with hash 760370116, now seen corresponding path program 2 times [2022-07-23 05:27:21,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:27:21,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142386363] [2022-07-23 05:27:21,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:27:21,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:27:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:27:21,115 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-23 05:27:21,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:27:21,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142386363] [2022-07-23 05:27:21,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142386363] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:27:21,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:27:21,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 05:27:21,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78774223] [2022-07-23 05:27:21,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:27:21,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:27:21,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:27:21,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:27:21,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:27:21,118 INFO L87 Difference]: Start difference. First operand 164 states and 201 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:21,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:27:21,148 INFO L93 Difference]: Finished difference Result 182 states and 205 transitions. [2022-07-23 05:27:21,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 05:27:21,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-23 05:27:21,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:27:21,149 INFO L225 Difference]: With dead ends: 182 [2022-07-23 05:27:21,149 INFO L226 Difference]: Without dead ends: 182 [2022-07-23 05:27:21,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-23 05:27:21,150 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 162 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:27:21,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 638 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:27:21,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-07-23 05:27:21,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2022-07-23 05:27:21,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 121 states have (on average 1.603305785123967) internal successors, (194), 158 states have internal predecessors, (194), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 05:27:21,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 202 transitions. [2022-07-23 05:27:21,154 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 202 transitions. Word has length 26 [2022-07-23 05:27:21,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:27:21,154 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 202 transitions. [2022-07-23 05:27:21,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:21,154 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 202 transitions. [2022-07-23 05:27:21,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-23 05:27:21,156 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:27:21,156 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:27:21,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 05:27:21,158 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting sll_appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 05:27:21,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:27:21,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1087676229, now seen corresponding path program 2 times [2022-07-23 05:27:21,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:27:21,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632850202] [2022-07-23 05:27:21,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:27:21,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:27:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:27:21,280 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 05:27:21,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:27:21,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632850202] [2022-07-23 05:27:21,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632850202] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:27:21,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535880288] [2022-07-23 05:27:21,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:27:21,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:27:21,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:27:21,282 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:27:21,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-23 05:27:21,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:27:21,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:27:21,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-23 05:27:21,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:27:21,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:27:21,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:27:21,438 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 05:27:21,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-23 05:27:21,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 05:27:21,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:21,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 05:27:21,487 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:27:21,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 05:27:21,515 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:27:21,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-23 05:27:21,552 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-23 05:27:21,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:27:21,837 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 05:27:21,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535880288] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:27:21,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:27:21,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 4] total 8 [2022-07-23 05:27:21,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887052639] [2022-07-23 05:27:21,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:27:21,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 05:27:21,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:27:21,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 05:27:21,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-07-23 05:27:21,839 INFO L87 Difference]: Start difference. First operand 165 states and 202 transitions. Second operand has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:21,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:27:21,873 INFO L93 Difference]: Finished difference Result 163 states and 198 transitions. [2022-07-23 05:27:21,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:27:21,873 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-23 05:27:21,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:27:21,874 INFO L225 Difference]: With dead ends: 163 [2022-07-23 05:27:21,874 INFO L226 Difference]: Without dead ends: 163 [2022-07-23 05:27:21,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-07-23 05:27:21,875 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 171 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:27:21,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 272 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 55 Unchecked, 0.0s Time] [2022-07-23 05:27:21,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-23 05:27:21,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2022-07-23 05:27:21,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 121 states have (on average 1.5702479338842976) internal successors, (190), 156 states have internal predecessors, (190), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 05:27:21,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 198 transitions. [2022-07-23 05:27:21,878 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 198 transitions. Word has length 26 [2022-07-23 05:27:21,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:27:21,879 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 198 transitions. [2022-07-23 05:27:21,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:21,879 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 198 transitions. [2022-07-23 05:27:21,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-23 05:27:21,880 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:27:21,880 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:27:21,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-23 05:27:22,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:27:22,093 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting sll_appendErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 05:27:22,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:27:22,094 INFO L85 PathProgramCache]: Analyzing trace with hash 320066679, now seen corresponding path program 1 times [2022-07-23 05:27:22,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:27:22,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267196800] [2022-07-23 05:27:22,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:27:22,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:27:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:27:22,180 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-23 05:27:22,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:27:22,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267196800] [2022-07-23 05:27:22,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267196800] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:27:22,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:27:22,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:27:22,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391469055] [2022-07-23 05:27:22,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:27:22,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 05:27:22,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:27:22,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 05:27:22,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:27:22,182 INFO L87 Difference]: Start difference. First operand 163 states and 198 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:22,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:27:22,272 INFO L93 Difference]: Finished difference Result 162 states and 196 transitions. [2022-07-23 05:27:22,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:27:22,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-23 05:27:22,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:27:22,273 INFO L225 Difference]: With dead ends: 162 [2022-07-23 05:27:22,273 INFO L226 Difference]: Without dead ends: 162 [2022-07-23 05:27:22,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:27:22,273 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 83 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:27:22,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 288 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:27:22,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-23 05:27:22,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2022-07-23 05:27:22,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 121 states have (on average 1.5537190082644627) internal successors, (188), 155 states have internal predecessors, (188), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 05:27:22,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 196 transitions. [2022-07-23 05:27:22,277 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 196 transitions. Word has length 31 [2022-07-23 05:27:22,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:27:22,277 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 196 transitions. [2022-07-23 05:27:22,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:22,277 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 196 transitions. [2022-07-23 05:27:22,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-23 05:27:22,278 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:27:22,278 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:27:22,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 05:27:22,278 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting sll_appendErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 05:27:22,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:27:22,279 INFO L85 PathProgramCache]: Analyzing trace with hash 320066680, now seen corresponding path program 1 times [2022-07-23 05:27:22,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:27:22,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850921540] [2022-07-23 05:27:22,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:27:22,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:27:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:27:22,355 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-23 05:27:22,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:27:22,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850921540] [2022-07-23 05:27:22,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850921540] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:27:22,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:27:22,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 05:27:22,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250471495] [2022-07-23 05:27:22,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:27:22,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:27:22,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:27:22,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:27:22,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:27:22,357 INFO L87 Difference]: Start difference. First operand 162 states and 196 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:22,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:27:22,421 INFO L93 Difference]: Finished difference Result 161 states and 194 transitions. [2022-07-23 05:27:22,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:27:22,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-23 05:27:22,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:27:22,422 INFO L225 Difference]: With dead ends: 161 [2022-07-23 05:27:22,423 INFO L226 Difference]: Without dead ends: 161 [2022-07-23 05:27:22,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-23 05:27:22,423 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 108 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:27:22,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 326 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:27:22,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-23 05:27:22,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2022-07-23 05:27:22,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 121 states have (on average 1.537190082644628) internal successors, (186), 154 states have internal predecessors, (186), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-23 05:27:22,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 194 transitions. [2022-07-23 05:27:22,429 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 194 transitions. Word has length 31 [2022-07-23 05:27:22,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:27:22,429 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 194 transitions. [2022-07-23 05:27:22,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:22,429 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 194 transitions. [2022-07-23 05:27:22,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-23 05:27:22,430 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:27:22,430 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:27:22,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 05:27:22,430 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting sll_appendErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 05:27:22,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:27:22,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1332132480, now seen corresponding path program 1 times [2022-07-23 05:27:22,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:27:22,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183285264] [2022-07-23 05:27:22,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:27:22,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:27:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:27:22,545 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-23 05:27:22,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:27:22,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183285264] [2022-07-23 05:27:22,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183285264] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:27:22,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088563300] [2022-07-23 05:27:22,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:27:22,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:27:22,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:27:22,547 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:27:22,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-23 05:27:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:27:22,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-23 05:27:22,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:27:22,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:27:22,685 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:27:22,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-23 05:27:22,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:22,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:27:22,744 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:27:22,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-23 05:27:22,798 INFO L356 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-07-23 05:27:22,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 38 [2022-07-23 05:27:22,904 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-23 05:27:22,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:27:23,151 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-23 05:27:23,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088563300] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:27:23,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:27:23,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 17 [2022-07-23 05:27:23,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548115802] [2022-07-23 05:27:23,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:27:23,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-23 05:27:23,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:27:23,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-23 05:27:23,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-07-23 05:27:23,154 INFO L87 Difference]: Start difference. First operand 161 states and 194 transitions. Second operand has 18 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:23,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:27:23,382 INFO L93 Difference]: Finished difference Result 222 states and 267 transitions. [2022-07-23 05:27:23,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 05:27:23,383 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-23 05:27:23,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:27:23,384 INFO L225 Difference]: With dead ends: 222 [2022-07-23 05:27:23,385 INFO L226 Difference]: Without dead ends: 222 [2022-07-23 05:27:23,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-07-23 05:27:23,386 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 283 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:27:23,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 782 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 341 Invalid, 0 Unknown, 164 Unchecked, 0.2s Time] [2022-07-23 05:27:23,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-07-23 05:27:23,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 213. [2022-07-23 05:27:23,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 170 states have (on average 1.4764705882352942) internal successors, (251), 205 states have internal predecessors, (251), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-23 05:27:23,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 265 transitions. [2022-07-23 05:27:23,392 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 265 transitions. Word has length 32 [2022-07-23 05:27:23,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:27:23,392 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 265 transitions. [2022-07-23 05:27:23,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.176470588235294) internal successors, (71), 16 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:23,393 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 265 transitions. [2022-07-23 05:27:23,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-23 05:27:23,393 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:27:23,393 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:27:23,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-23 05:27:23,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:27:23,612 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting sll_appendErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 05:27:23,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:27:23,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1332132481, now seen corresponding path program 1 times [2022-07-23 05:27:23,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:27:23,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155584171] [2022-07-23 05:27:23,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:27:23,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:27:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:27:23,726 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-23 05:27:23,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:27:23,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155584171] [2022-07-23 05:27:23,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155584171] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:27:23,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552036149] [2022-07-23 05:27:23,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:27:23,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:27:23,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:27:23,728 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:27:23,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-23 05:27:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:27:23,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-23 05:27:23,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:27:23,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:27:23,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:23,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 05:27:23,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:23,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 05:27:23,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:23,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 05:27:23,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:23,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 05:27:24,002 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-23 05:27:24,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:27:24,506 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-23 05:27:24,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552036149] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:27:24,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:27:24,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-07-23 05:27:24,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670077460] [2022-07-23 05:27:24,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:27:24,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-23 05:27:24,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:27:24,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-23 05:27:24,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-23 05:27:24,508 INFO L87 Difference]: Start difference. First operand 213 states and 265 transitions. Second operand has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:24,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:27:24,607 INFO L93 Difference]: Finished difference Result 219 states and 263 transitions. [2022-07-23 05:27:24,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 05:27:24,607 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-23 05:27:24,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:27:24,608 INFO L225 Difference]: With dead ends: 219 [2022-07-23 05:27:24,608 INFO L226 Difference]: Without dead ends: 219 [2022-07-23 05:27:24,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-23 05:27:24,609 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 68 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:27:24,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 481 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 147 Invalid, 0 Unknown, 99 Unchecked, 0.1s Time] [2022-07-23 05:27:24,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-07-23 05:27:24,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 212. [2022-07-23 05:27:24,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 170 states have (on average 1.4529411764705882) internal successors, (247), 204 states have internal predecessors, (247), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-23 05:27:24,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 261 transitions. [2022-07-23 05:27:24,614 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 261 transitions. Word has length 32 [2022-07-23 05:27:24,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:27:24,614 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 261 transitions. [2022-07-23 05:27:24,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:24,614 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 261 transitions. [2022-07-23 05:27:24,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-23 05:27:24,615 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:27:24,615 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:27:24,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-23 05:27:24,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-23 05:27:24,830 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting sll_appendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 05:27:24,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:27:24,831 INFO L85 PathProgramCache]: Analyzing trace with hash 60922559, now seen corresponding path program 1 times [2022-07-23 05:27:24,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:27:24,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086820802] [2022-07-23 05:27:24,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:27:24,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:27:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:27:25,023 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-23 05:27:25,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:27:25,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086820802] [2022-07-23 05:27:25,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086820802] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:27:25,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028226472] [2022-07-23 05:27:25,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:27:25,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:27:25,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:27:25,025 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:27:25,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-23 05:27:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:27:25,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-23 05:27:25,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:27:25,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:25,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:27:25,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:25,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:27:25,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:25,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-23 05:27:25,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:25,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:27:25,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:25,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:27:25,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:25,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:25,559 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-23 05:27:25,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2022-07-23 05:27:25,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:25,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:27:25,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:25,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:25,662 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:27:25,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2022-07-23 05:27:25,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:25,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:27:25,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:25,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:27:25,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:25,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:27:25,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:25,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:27:25,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 05:27:25,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 05:27:25,813 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:27:25,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:27:25,832 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_~new_last~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_~new_last~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-07-23 05:27:25,863 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_503 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_#res#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|))) (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_#res#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-07-23 05:27:25,868 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-07-23 05:27:25,905 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|)))) is different from false [2022-07-23 05:27:25,918 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-23 05:27:25,928 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|))))) is different from false [2022-07-23 05:27:25,943 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2022-07-23 05:27:25,974 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 |c_sll_append_sll_create_~head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|))))) is different from false [2022-07-23 05:27:25,993 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|))))) is different from false [2022-07-23 05:27:26,072 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_492 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_491 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|))))) is different from false [2022-07-23 05:27:26,145 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (forall ((v_ArrVal_491 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_492 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|))))))) is different from false [2022-07-23 05:27:26,251 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (forall ((v_ArrVal_492 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_503) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_491 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_504) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|))))) is different from false [2022-07-23 05:27:26,305 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_492 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_503) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_491 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= 0 (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_504) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|))))) is different from false [2022-07-23 05:27:26,566 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-07-23 05:27:26,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028226472] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:27:26,566 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:27:26,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 18] total 41 [2022-07-23 05:27:26,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263944226] [2022-07-23 05:27:26,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:27:26,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-23 05:27:26,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:27:26,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-23 05:27:26,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=632, Unknown=13, NotChecked=832, Total=1640 [2022-07-23 05:27:26,569 INFO L87 Difference]: Start difference. First operand 212 states and 261 transitions. Second operand has 41 states, 41 states have (on average 2.1707317073170733) internal successors, (89), 38 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:26,581 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_492 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_503) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|)))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_491 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= 0 (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_504) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#head~1#1.base|)) is different from false [2022-07-23 05:27:26,588 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_sll_append_#in~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_sll_append_#in~head#1.base|))) (and (= |c_sll_append_#in~head#1.offset| 0) (= (select .cse0 0) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_sll_append_#in~head#1.base|) (< |c_#StackHeapBarrier| |c_sll_append_#in~head#1.base|) (= (select .cse1 |c_sll_append_#in~head#1.offset|) 0) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (forall ((v_ArrVal_492 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_492))) (store .cse3 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse3 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 0))))) (store .cse2 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse2 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_503) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|)))) (= (select .cse1 0) 0) (= (select |c_#valid| |c_sll_append_#in~head#1.base|) 1) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_491 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| v_ArrVal_504) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_17| |c_#StackHeapBarrier|)))) (= (select .cse0 |c_sll_append_#in~head#1.offset|) 0))) is different from false [2022-07-23 05:27:26,594 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (forall ((v_ArrVal_491 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_28| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_28| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_492 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_28| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-23 05:27:26,611 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (forall ((v_ArrVal_492 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_492))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((v_ArrVal_491 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_491) |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-23 05:27:28,629 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-23 05:27:28,639 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_27| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_27| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_27|) 0 |c_sll_append_sll_create_~head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_27| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-23 05:27:30,642 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (forall ((v_ArrVal_494 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_494) |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-23 05:27:30,647 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (exists ((|sll_append_sll_create_~new_head~0#1.base| Int)) (and (< |sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset|) 0))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-23 05:27:30,651 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|sll_append_sll_create_~new_head~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~head~0#1.offset|) 0) (< |sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|))) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_496 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_26| v_ArrVal_496) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_504) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_26|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_503) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-23 05:27:32,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:27:32,084 INFO L93 Difference]: Finished difference Result 264 states and 321 transitions. [2022-07-23 05:27:32,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-23 05:27:32,085 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.1707317073170733) internal successors, (89), 38 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-23 05:27:32,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:27:32,086 INFO L225 Difference]: With dead ends: 264 [2022-07-23 05:27:32,086 INFO L226 Difference]: Without dead ends: 264 [2022-07-23 05:27:32,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=243, Invalid=1083, Unknown=22, NotChecked=1958, Total=3306 [2022-07-23 05:27:32,087 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 26 mSDsluCounter, 2142 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2238 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 551 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:27:32,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2238 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 336 Invalid, 0 Unknown, 551 Unchecked, 0.2s Time] [2022-07-23 05:27:32,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-07-23 05:27:32,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 243. [2022-07-23 05:27:32,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 199 states have (on average 1.3969849246231156) internal successors, (278), 234 states have internal predecessors, (278), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (11), 4 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-23 05:27:32,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 297 transitions. [2022-07-23 05:27:32,094 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 297 transitions. Word has length 35 [2022-07-23 05:27:32,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:27:32,095 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 297 transitions. [2022-07-23 05:27:32,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.1707317073170733) internal successors, (89), 38 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:32,095 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 297 transitions. [2022-07-23 05:27:32,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-23 05:27:32,095 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:27:32,095 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:27:32,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-23 05:27:32,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:27:32,296 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting sll_appendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 05:27:32,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:27:32,297 INFO L85 PathProgramCache]: Analyzing trace with hash 762522433, now seen corresponding path program 1 times [2022-07-23 05:27:32,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:27:32,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057567486] [2022-07-23 05:27:32,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:27:32,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:27:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:27:32,325 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-23 05:27:32,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:27:32,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057567486] [2022-07-23 05:27:32,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057567486] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:27:32,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:27:32,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:27:32,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439870798] [2022-07-23 05:27:32,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:27:32,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:27:32,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:27:32,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:27:32,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:27:32,327 INFO L87 Difference]: Start difference. First operand 243 states and 297 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:32,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:27:32,334 INFO L93 Difference]: Finished difference Result 247 states and 298 transitions. [2022-07-23 05:27:32,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:27:32,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-23 05:27:32,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:27:32,336 INFO L225 Difference]: With dead ends: 247 [2022-07-23 05:27:32,336 INFO L226 Difference]: Without dead ends: 247 [2022-07-23 05:27:32,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:27:32,338 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:27:32,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:27:32,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-23 05:27:32,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2022-07-23 05:27:32,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 204 states have (on average 1.3823529411764706) internal successors, (282), 238 states have internal predecessors, (282), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-23 05:27:32,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 298 transitions. [2022-07-23 05:27:32,344 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 298 transitions. Word has length 35 [2022-07-23 05:27:32,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:27:32,344 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 298 transitions. [2022-07-23 05:27:32,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:32,344 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 298 transitions. [2022-07-23 05:27:32,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-23 05:27:32,344 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:27:32,345 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:27:32,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-23 05:27:32,345 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting sll_appendErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 05:27:32,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:27:32,345 INFO L85 PathProgramCache]: Analyzing trace with hash 444674194, now seen corresponding path program 1 times [2022-07-23 05:27:32,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:27:32,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223115021] [2022-07-23 05:27:32,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:27:32,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:27:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:27:32,391 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-23 05:27:32,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:27:32,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223115021] [2022-07-23 05:27:32,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223115021] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:27:32,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453238674] [2022-07-23 05:27:32,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:27:32,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:27:32,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:27:32,396 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:27:32,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-23 05:27:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:27:32,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-23 05:27:32,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:27:32,513 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-23 05:27:32,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:27:32,570 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-23 05:27:32,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453238674] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:27:32,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:27:32,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-23 05:27:32,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671329826] [2022-07-23 05:27:32,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:27:32,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 05:27:32,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:27:32,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 05:27:32,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-23 05:27:32,572 INFO L87 Difference]: Start difference. First operand 247 states and 298 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:32,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:27:32,645 INFO L93 Difference]: Finished difference Result 263 states and 306 transitions. [2022-07-23 05:27:32,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 05:27:32,646 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-23 05:27:32,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:27:32,647 INFO L225 Difference]: With dead ends: 263 [2022-07-23 05:27:32,647 INFO L226 Difference]: Without dead ends: 263 [2022-07-23 05:27:32,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-07-23 05:27:32,648 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 197 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:27:32,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 899 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:27:32,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-07-23 05:27:32,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 255. [2022-07-23 05:27:32,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 212 states have (on average 1.3679245283018868) internal successors, (290), 246 states have internal predecessors, (290), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-23 05:27:32,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 306 transitions. [2022-07-23 05:27:32,655 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 306 transitions. Word has length 36 [2022-07-23 05:27:32,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:27:32,656 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 306 transitions. [2022-07-23 05:27:32,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:32,656 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 306 transitions. [2022-07-23 05:27:32,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-23 05:27:32,657 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:27:32,657 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:27:32,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-23 05:27:32,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:27:32,874 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting sll_appendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 05:27:32,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:27:32,875 INFO L85 PathProgramCache]: Analyzing trace with hash -308582730, now seen corresponding path program 1 times [2022-07-23 05:27:32,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:27:32,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760814072] [2022-07-23 05:27:32,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:27:32,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:27:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:27:32,965 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:27:32,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:27:32,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760814072] [2022-07-23 05:27:32,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760814072] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:27:32,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423528180] [2022-07-23 05:27:32,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:27:32,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:27:32,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:27:32,968 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:27:32,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-23 05:27:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:27:33,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-23 05:27:33,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:27:33,106 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:27:33,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:27:33,135 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:27:33,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423528180] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:27:33,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:27:33,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2022-07-23 05:27:33,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149012740] [2022-07-23 05:27:33,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:27:33,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 05:27:33,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:27:33,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 05:27:33,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-23 05:27:33,137 INFO L87 Difference]: Start difference. First operand 255 states and 306 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:33,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:27:33,251 INFO L93 Difference]: Finished difference Result 369 states and 428 transitions. [2022-07-23 05:27:33,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 05:27:33,252 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-23 05:27:33,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:27:33,253 INFO L225 Difference]: With dead ends: 369 [2022-07-23 05:27:33,253 INFO L226 Difference]: Without dead ends: 369 [2022-07-23 05:27:33,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2022-07-23 05:27:33,254 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 162 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:27:33,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1150 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:27:33,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-07-23 05:27:33,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 318. [2022-07-23 05:27:33,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 274 states have (on average 1.3722627737226278) internal successors, (376), 308 states have internal predecessors, (376), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-23 05:27:33,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 390 transitions. [2022-07-23 05:27:33,262 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 390 transitions. Word has length 40 [2022-07-23 05:27:33,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:27:33,262 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 390 transitions. [2022-07-23 05:27:33,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:33,263 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 390 transitions. [2022-07-23 05:27:33,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-23 05:27:33,263 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:27:33,263 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:27:33,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-23 05:27:33,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-23 05:27:33,483 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting sll_appendErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 05:27:33,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:27:33,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1726785188, now seen corresponding path program 2 times [2022-07-23 05:27:33,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:27:33,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188473632] [2022-07-23 05:27:33,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:27:33,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:27:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:27:33,576 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-23 05:27:33,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:27:33,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188473632] [2022-07-23 05:27:33,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188473632] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:27:33,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822454681] [2022-07-23 05:27:33,577 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:27:33,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:27:33,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:27:33,578 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:27:33,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-23 05:27:33,678 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:27:33,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:27:33,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-23 05:27:33,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:27:33,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:27:33,720 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:27:33,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-23 05:27:33,736 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:27:33,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-23 05:27:33,792 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-07-23 05:27:33,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 43 [2022-07-23 05:27:33,890 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-07-23 05:27:33,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 43 [2022-07-23 05:27:34,015 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-23 05:27:34,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:27:34,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822454681] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:27:34,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 05:27:34,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 12 [2022-07-23 05:27:34,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439012034] [2022-07-23 05:27:34,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:27:34,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 05:27:34,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:27:34,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 05:27:34,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-07-23 05:27:34,017 INFO L87 Difference]: Start difference. First operand 318 states and 390 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:34,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:27:34,095 INFO L93 Difference]: Finished difference Result 342 states and 414 transitions. [2022-07-23 05:27:34,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:27:34,095 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-23 05:27:34,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:27:34,096 INFO L225 Difference]: With dead ends: 342 [2022-07-23 05:27:34,096 INFO L226 Difference]: Without dead ends: 342 [2022-07-23 05:27:34,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-07-23 05:27:34,098 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 164 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:27:34,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 328 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 122 Invalid, 0 Unknown, 78 Unchecked, 0.1s Time] [2022-07-23 05:27:34,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-07-23 05:27:34,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 315. [2022-07-23 05:27:34,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 274 states have (on average 1.354014598540146) internal successors, (371), 305 states have internal predecessors, (371), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-23 05:27:34,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 385 transitions. [2022-07-23 05:27:34,105 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 385 transitions. Word has length 44 [2022-07-23 05:27:34,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:27:34,105 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 385 transitions. [2022-07-23 05:27:34,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:34,106 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 385 transitions. [2022-07-23 05:27:34,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-23 05:27:34,106 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:27:34,106 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:27:34,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-23 05:27:34,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-23 05:27:34,324 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting sll_appendErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 05:27:34,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:27:34,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1726785189, now seen corresponding path program 1 times [2022-07-23 05:27:34,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:27:34,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922064596] [2022-07-23 05:27:34,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:27:34,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:27:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:27:34,439 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-23 05:27:34,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:27:34,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922064596] [2022-07-23 05:27:34,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922064596] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:27:34,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525241379] [2022-07-23 05:27:34,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:27:34,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:27:34,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:27:34,442 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:27:34,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-23 05:27:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:27:34,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-23 05:27:34,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:27:34,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:27:34,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:34,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 05:27:34,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:34,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 05:27:34,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:34,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 05:27:34,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:34,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 05:27:34,739 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-23 05:27:34,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:27:37,306 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-23 05:27:37,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525241379] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:27:37,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:27:37,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-07-23 05:27:37,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143529945] [2022-07-23 05:27:37,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:27:37,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 05:27:37,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:27:37,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 05:27:37,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-07-23 05:27:37,310 INFO L87 Difference]: Start difference. First operand 315 states and 385 transitions. Second operand has 14 states, 13 states have (on average 6.538461538461538) internal successors, (85), 11 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:37,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:27:37,467 INFO L93 Difference]: Finished difference Result 339 states and 409 transitions. [2022-07-23 05:27:37,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:27:37,467 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.538461538461538) internal successors, (85), 11 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-23 05:27:37,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:27:37,468 INFO L225 Difference]: With dead ends: 339 [2022-07-23 05:27:37,468 INFO L226 Difference]: Without dead ends: 339 [2022-07-23 05:27:37,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-07-23 05:27:37,470 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 176 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:27:37,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 357 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 190 Invalid, 0 Unknown, 112 Unchecked, 0.1s Time] [2022-07-23 05:27:37,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-07-23 05:27:37,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 256. [2022-07-23 05:27:37,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 221 states have (on average 1.3529411764705883) internal successors, (299), 247 states have internal predecessors, (299), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-23 05:27:37,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 309 transitions. [2022-07-23 05:27:37,475 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 309 transitions. Word has length 44 [2022-07-23 05:27:37,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:27:37,475 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 309 transitions. [2022-07-23 05:27:37,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.538461538461538) internal successors, (85), 11 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:37,475 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 309 transitions. [2022-07-23 05:27:37,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-23 05:27:37,476 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:27:37,476 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:27:37,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-23 05:27:37,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:27:37,693 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting sll_appendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 05:27:37,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:27:37,694 INFO L85 PathProgramCache]: Analyzing trace with hash 685803597, now seen corresponding path program 2 times [2022-07-23 05:27:37,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:27:37,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565610769] [2022-07-23 05:27:37,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:27:37,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:27:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:27:37,980 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-23 05:27:37,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:27:37,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565610769] [2022-07-23 05:27:37,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565610769] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:27:37,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548982364] [2022-07-23 05:27:37,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:27:37,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:27:37,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:27:37,999 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:27:38,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-23 05:27:38,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:27:38,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:27:38,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-23 05:27:38,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:27:38,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:38,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:27:38,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:38,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:27:38,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:38,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:27:38,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:38,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:27:38,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:38,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:27:38,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:38,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:27:38,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:38,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:27:38,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:38,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:27:38,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:38,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:27:38,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:38,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:27:38,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:38,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:27:38,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:38,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:27:38,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:38,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:27:38,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:38,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:27:38,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 05:27:38,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 05:27:38,588 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-23 05:27:38,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:27:38,609 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1018 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_~new_last~0#1.base| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1017 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_~new_last~0#1.base| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-07-23 05:27:38,629 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_~new_last~0#1.base_13| Int)) (or (forall ((v_ArrVal_1017 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (<= |v_sll_append_~new_last~0#1.base_13| |c_sll_append_node_create_with_sublist_#res#1.base|)))) (forall ((|v_sll_append_~new_last~0#1.base_13| Int)) (or (forall ((v_ArrVal_1018 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (<= |v_sll_append_~new_last~0#1.base_13| |c_sll_append_node_create_with_sublist_#res#1.base|))))) is different from false [2022-07-23 05:27:38,640 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1018 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store |c_#memory_$Pointer$.base| |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (forall ((v_ArrVal_1017 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (= (select (select (store |c_#memory_$Pointer$.offset| |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) is different from false [2022-07-23 05:27:38,649 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|)))) is different from false [2022-07-23 05:27:38,726 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|)))) is different from false [2022-07-23 05:27:38,755 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_40| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= 0 (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|)) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_40| Int)) (or (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|))))) is different from false [2022-07-23 05:27:38,793 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1009 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_40| Int)) (or (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_40| Int) (v_ArrVal_1010 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))))) is different from false [2022-07-23 05:27:38,868 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1009 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_40| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_40| Int) (v_ArrVal_1010 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|))))) is different from false [2022-07-23 05:27:38,942 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1008 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_40| Int) (v_ArrVal_1010 (Array Int Int))) (or (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_1007 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1009 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_40| Int)) (or (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|))))))) is different from false [2022-07-23 05:27:39,013 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1007 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1009 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_40| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))))))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int)) (or (forall ((v_ArrVal_1008 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_40| Int) (v_ArrVal_1010 (Array Int Int))) (or (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|))))) is different from false [2022-07-23 05:27:39,098 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (v_ArrVal_1005 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1007 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((v_ArrVal_1009 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_40| Int)) (or (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (v_ArrVal_1006 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1008 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_40| Int) (v_ArrVal_1010 (Array Int Int))) (or (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|))))))) is different from false [2022-07-23 05:27:39,212 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (v_ArrVal_1006 (Array Int Int))) (or (forall ((v_ArrVal_1008 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_40| Int) (v_ArrVal_1010 (Array Int Int))) (or (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (v_ArrVal_1005 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1007 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1009 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_40| Int)) (or (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|))))))))))) is different from false [2022-07-23 05:27:41,392 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (v_ArrVal_1005 (Array Int Int))) (or (forall ((v_ArrVal_1007 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((v_ArrVal_1009 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_40| Int)) (or (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |v_sll_append_~new_last~0#1.base_13|) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1011) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)))))) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (v_ArrVal_1006 (Array Int Int))) (or (forall ((v_ArrVal_1008 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_40| Int) (v_ArrVal_1010 (Array Int Int))) (or (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |v_sll_append_~new_last~0#1.base_13|) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1012) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|))))))))) is different from false [2022-07-23 05:27:43,483 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (v_ArrVal_1006 (Array Int Int))) (or (forall ((v_ArrVal_1008 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_40| Int) (v_ArrVal_1010 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1012) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |v_sll_append_~new_last~0#1.base_13|))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)))))))) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (v_ArrVal_1005 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1007 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((v_ArrVal_1009 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_40| Int)) (or (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1011) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|))))))))))) is different from false [2022-07-23 05:27:44,103 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 28 not checked. [2022-07-23 05:27:44,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548982364] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:27:44,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:27:44,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 19] total 36 [2022-07-23 05:27:44,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148143564] [2022-07-23 05:27:44,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:27:44,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-23 05:27:44,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:27:44,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-23 05:27:44,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=395, Unknown=14, NotChecked=742, Total=1260 [2022-07-23 05:27:44,109 INFO L87 Difference]: Start difference. First operand 256 states and 309 transitions. Second operand has 36 states, 36 states have (on average 2.638888888888889) internal successors, (95), 33 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:46,125 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (v_ArrVal_1006 (Array Int Int))) (or (forall ((v_ArrVal_1008 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_40| Int) (v_ArrVal_1010 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1012) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |v_sll_append_~new_last~0#1.base_13|))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)))))))) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (v_ArrVal_1005 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1007 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((v_ArrVal_1009 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_40| Int)) (or (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1011) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)))))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#head~1#1.base|)) is different from false [2022-07-23 05:27:48,130 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_sll_append_#in~head#1.offset| 0) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (v_ArrVal_1005 (Array Int Int))) (or (forall ((v_ArrVal_1007 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((v_ArrVal_1009 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_40| Int)) (or (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |v_sll_append_~new_last~0#1.base_13|) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1011) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)))))) (<= (+ |c_#StackHeapBarrier| 1) |c_sll_append_#in~head#1.base|) (< |c_#StackHeapBarrier| |c_sll_append_#in~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0) (= (select |c_#valid| |c_sll_append_#in~head#1.base|) 1) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (v_ArrVal_1006 (Array Int Int))) (or (forall ((v_ArrVal_1008 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_40| Int) (v_ArrVal_1010 (Array Int Int))) (or (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| |v_sll_append_~new_last~0#1.base_13|) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1012) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_21| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) is different from false [2022-07-23 05:27:50,135 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (v_ArrVal_1006 (Array Int Int))) (or (forall ((v_ArrVal_1008 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_40| Int) (v_ArrVal_1010 (Array Int Int))) (or (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1006) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)))))) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int) (v_ArrVal_1005 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1007 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1009 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_40| Int)) (or (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_43| v_ArrVal_1005) |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)))))))))) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-23 05:27:52,205 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1007 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1009 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_40| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))))))))) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int)) (or (forall ((v_ArrVal_1008 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_40| Int) (v_ArrVal_1010 (Array Int Int))) (or (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-23 05:27:54,210 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1007 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1009 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_40| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1007) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1009) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1011) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1016) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1018) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))))))))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_42| Int)) (or (forall ((v_ArrVal_1008 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_40| Int) (v_ArrVal_1010 (Array Int Int))) (or (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_13| Int)) (or (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_42| v_ArrVal_1008) |v_sll_append_sll_create_~new_head~0#1.base_41| v_ArrVal_1010) |v_sll_append_sll_create_~new_head~0#1.base_40| v_ArrVal_1012) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1015) |v_sll_append_~new_last~0#1.base_13| v_ArrVal_1017) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_13|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_40| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-23 05:27:54,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:27:54,427 INFO L93 Difference]: Finished difference Result 308 states and 370 transitions. [2022-07-23 05:27:54,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 05:27:54,427 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.638888888888889) internal successors, (95), 33 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-23 05:27:54,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:27:54,428 INFO L225 Difference]: With dead ends: 308 [2022-07-23 05:27:54,428 INFO L226 Difference]: Without dead ends: 308 [2022-07-23 05:27:54,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=164, Invalid=543, Unknown=19, NotChecked=1254, Total=1980 [2022-07-23 05:27:54,429 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 28 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1862 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 541 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:27:54,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1862 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 294 Invalid, 0 Unknown, 541 Unchecked, 0.1s Time] [2022-07-23 05:27:54,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-07-23 05:27:54,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 303. [2022-07-23 05:27:54,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 265 states have (on average 1.3169811320754716) internal successors, (349), 293 states have internal predecessors, (349), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-23 05:27:54,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 365 transitions. [2022-07-23 05:27:54,435 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 365 transitions. Word has length 44 [2022-07-23 05:27:54,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:27:54,435 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 365 transitions. [2022-07-23 05:27:54,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.638888888888889) internal successors, (95), 33 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:54,436 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 365 transitions. [2022-07-23 05:27:54,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-23 05:27:54,436 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:27:54,436 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:27:54,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-23 05:27:54,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:27:54,637 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting sll_appendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 05:27:54,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:27:54,637 INFO L85 PathProgramCache]: Analyzing trace with hash -686003701, now seen corresponding path program 1 times [2022-07-23 05:27:54,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:27:54,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349932782] [2022-07-23 05:27:54,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:27:54,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:27:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:27:54,667 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-23 05:27:54,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:27:54,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349932782] [2022-07-23 05:27:54,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349932782] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:27:54,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:27:54,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:27:54,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815556555] [2022-07-23 05:27:54,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:27:54,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:27:54,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:27:54,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:27:54,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:27:54,670 INFO L87 Difference]: Start difference. First operand 303 states and 365 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:54,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:27:54,683 INFO L93 Difference]: Finished difference Result 398 states and 486 transitions. [2022-07-23 05:27:54,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:27:54,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-23 05:27:54,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:27:54,685 INFO L225 Difference]: With dead ends: 398 [2022-07-23 05:27:54,685 INFO L226 Difference]: Without dead ends: 398 [2022-07-23 05:27:54,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:27:54,686 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 69 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:27:54,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 331 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:27:54,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-07-23 05:27:54,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 307. [2022-07-23 05:27:54,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 269 states have (on average 1.3011152416356877) internal successors, (350), 297 states have internal predecessors, (350), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-23 05:27:54,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 366 transitions. [2022-07-23 05:27:54,694 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 366 transitions. Word has length 44 [2022-07-23 05:27:54,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:27:54,694 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 366 transitions. [2022-07-23 05:27:54,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:54,695 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 366 transitions. [2022-07-23 05:27:54,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-23 05:27:54,695 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:27:54,695 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:27:54,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-23 05:27:54,695 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting sll_appendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 05:27:54,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:27:54,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1834257435, now seen corresponding path program 1 times [2022-07-23 05:27:54,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:27:54,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805287198] [2022-07-23 05:27:54,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:27:54,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:27:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:27:54,915 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-23 05:27:54,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:27:54,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805287198] [2022-07-23 05:27:54,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805287198] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:27:54,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583195204] [2022-07-23 05:27:54,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:27:54,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:27:54,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:27:54,931 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:27:54,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-23 05:27:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:27:55,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-23 05:27:55,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:27:55,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:55,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:27:55,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:55,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:27:55,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:55,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:27:55,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:55,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-23 05:27:55,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:55,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:27:55,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:55,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:55,598 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:27:55,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2022-07-23 05:27:55,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:55,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:27:55,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:55,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:27:55,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:55,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:27:55,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:55,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:27:55,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:55,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:27:55,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:55,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:27:55,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 05:27:55,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 05:27:55,770 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-23 05:27:55,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:27:55,782 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1176 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_~new_last~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_~new_last~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-07-23 05:27:55,786 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_#res#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1176 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_#res#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-07-23 05:27:55,790 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1176 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-07-23 05:27:55,815 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-07-23 05:27:55,834 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|))))) is different from false [2022-07-23 05:27:55,851 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1168 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|))))) is different from false [2022-07-23 05:27:55,879 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1168 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))))) is different from false [2022-07-23 05:27:55,896 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1168 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|))))))) is different from false [2022-07-23 05:27:55,921 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1165 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1165))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_1166 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (forall ((v_ArrVal_1168 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|))))) is different from false [2022-07-23 05:27:55,975 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (forall ((v_ArrVal_1166 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (forall ((v_ArrVal_1168 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1165 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1165))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))))))) is different from false [2022-07-23 05:27:56,068 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (forall ((v_ArrVal_1166 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1168 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1171) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1177) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (forall ((v_ArrVal_1165 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1165))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1170) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1176) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| |c_#StackHeapBarrier|))))) is different from false [2022-07-23 05:27:56,102 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1166 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1168 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1171) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1177) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))))))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (forall ((v_ArrVal_1165 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1165))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1170) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1176) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| |c_#StackHeapBarrier|))))) is different from false [2022-07-23 05:27:56,621 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 15 not checked. [2022-07-23 05:27:56,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583195204] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:27:56,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:27:56,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 17] total 38 [2022-07-23 05:27:56,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438009623] [2022-07-23 05:27:56,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:27:56,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-23 05:27:56,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:27:56,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-23 05:27:56,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=544, Unknown=12, NotChecked=708, Total=1406 [2022-07-23 05:27:56,625 INFO L87 Difference]: Start difference. First operand 307 states and 366 transitions. Second operand has 38 states, 38 states have (on average 2.5) internal successors, (95), 35 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:27:56,633 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1166 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1168 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1171) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1177) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))))))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| |c_#StackHeapBarrier|)))) (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (forall ((v_ArrVal_1165 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1165))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1170) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1176) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| |c_#StackHeapBarrier|)))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#head~1#1.base|)) is different from false [2022-07-23 05:27:56,653 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_sll_append_#in~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_sll_append_#in~head#1.base|))) (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (forall ((v_ArrVal_1166 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1168 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1171) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1177) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| |c_#StackHeapBarrier|)))) (= |c_sll_append_#in~head#1.offset| 0) (= (select .cse0 0) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_sll_append_#in~head#1.base|) (< |c_#StackHeapBarrier| |c_sll_append_#in~head#1.base|) (= (select .cse1 |c_sll_append_#in~head#1.offset|) 0) (= (select .cse1 0) 0) (= (select |c_#valid| |c_sll_append_#in~head#1.base|) 1) (= (select .cse0 |c_sll_append_#in~head#1.offset|) 0) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (forall ((v_ArrVal_1165 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1165))) (store .cse2 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse2 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1170) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| v_ArrVal_1176) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_22| |c_#StackHeapBarrier|)))))) is different from false [2022-07-23 05:27:56,657 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (forall ((v_ArrVal_1166 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (forall ((v_ArrVal_1168 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1165 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_1165))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))))))) is different from false [2022-07-23 05:27:56,660 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (forall ((v_ArrVal_1165 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1165))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((v_ArrVal_1166 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (forall ((v_ArrVal_1168 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1166) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)))) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-23 05:27:58,664 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1168 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))))) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-23 05:28:00,668 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1168 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_47| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_47|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-23 05:28:00,676 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((v_ArrVal_1168 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1168) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-23 05:28:00,685 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1171) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1177) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_1170) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1176) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))) (exists ((|sll_append_sll_create_~new_head~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) 0) 0) (< |sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-07-23 05:28:01,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:28:01,017 INFO L93 Difference]: Finished difference Result 356 states and 418 transitions. [2022-07-23 05:28:01,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-23 05:28:01,018 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.5) internal successors, (95), 35 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-07-23 05:28:01,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:28:01,019 INFO L225 Difference]: With dead ends: 356 [2022-07-23 05:28:01,019 INFO L226 Difference]: Without dead ends: 356 [2022-07-23 05:28:01,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=222, Invalid=960, Unknown=20, NotChecked=1660, Total=2862 [2022-07-23 05:28:01,020 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 27 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1875 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 552 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:28:01,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1875 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 304 Invalid, 0 Unknown, 552 Unchecked, 0.1s Time] [2022-07-23 05:28:01,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-07-23 05:28:01,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 337. [2022-07-23 05:28:01,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 297 states have (on average 1.2760942760942762) internal successors, (379), 326 states have internal predecessors, (379), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 4 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-23 05:28:01,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 398 transitions. [2022-07-23 05:28:01,027 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 398 transitions. Word has length 47 [2022-07-23 05:28:01,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:28:01,027 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 398 transitions. [2022-07-23 05:28:01,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.5) internal successors, (95), 35 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:28:01,027 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 398 transitions. [2022-07-23 05:28:01,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-23 05:28:01,028 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:28:01,028 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:28:01,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-23 05:28:01,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-23 05:28:01,239 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 05:28:01,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:28:01,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1659810607, now seen corresponding path program 1 times [2022-07-23 05:28:01,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:28:01,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616232266] [2022-07-23 05:28:01,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:28:01,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:28:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:28:01,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 05:28:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:28:01,293 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-23 05:28:01,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:28:01,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616232266] [2022-07-23 05:28:01,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616232266] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:28:01,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:28:01,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 05:28:01,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510851346] [2022-07-23 05:28:01,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:28:01,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 05:28:01,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:28:01,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 05:28:01,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:28:01,295 INFO L87 Difference]: Start difference. First operand 337 states and 398 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 05:28:01,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:28:01,373 INFO L93 Difference]: Finished difference Result 393 states and 460 transitions. [2022-07-23 05:28:01,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:28:01,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-07-23 05:28:01,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:28:01,375 INFO L225 Difference]: With dead ends: 393 [2022-07-23 05:28:01,375 INFO L226 Difference]: Without dead ends: 393 [2022-07-23 05:28:01,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:28:01,375 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 192 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:28:01,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 284 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:28:01,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2022-07-23 05:28:01,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 337. [2022-07-23 05:28:01,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 297 states have (on average 1.2760942760942762) internal successors, (379), 326 states have internal predecessors, (379), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 4 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-23 05:28:01,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 398 transitions. [2022-07-23 05:28:01,382 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 398 transitions. Word has length 54 [2022-07-23 05:28:01,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:28:01,383 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 398 transitions. [2022-07-23 05:28:01,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 05:28:01,383 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 398 transitions. [2022-07-23 05:28:01,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-23 05:28:01,383 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:28:01,384 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:28:01,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-23 05:28:01,384 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 05:28:01,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:28:01,384 INFO L85 PathProgramCache]: Analyzing trace with hash -85479915, now seen corresponding path program 1 times [2022-07-23 05:28:01,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:28:01,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916902215] [2022-07-23 05:28:01,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:28:01,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:28:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:28:01,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 05:28:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:28:01,507 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-23 05:28:01,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:28:01,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916902215] [2022-07-23 05:28:01,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916902215] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:28:01,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:28:01,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 05:28:01,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137105073] [2022-07-23 05:28:01,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:28:01,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 05:28:01,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:28:01,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 05:28:01,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-23 05:28:01,509 INFO L87 Difference]: Start difference. First operand 337 states and 398 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 05:28:01,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:28:01,830 INFO L93 Difference]: Finished difference Result 547 states and 660 transitions. [2022-07-23 05:28:01,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 05:28:01,831 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-07-23 05:28:01,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:28:01,833 INFO L225 Difference]: With dead ends: 547 [2022-07-23 05:28:01,833 INFO L226 Difference]: Without dead ends: 547 [2022-07-23 05:28:01,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-07-23 05:28:01,834 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 281 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:28:01,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 640 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 05:28:01,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-07-23 05:28:01,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 350. [2022-07-23 05:28:01,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 311 states have (on average 1.2861736334405145) internal successors, (400), 338 states have internal predecessors, (400), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 5 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-23 05:28:01,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 419 transitions. [2022-07-23 05:28:01,842 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 419 transitions. Word has length 55 [2022-07-23 05:28:01,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:28:01,842 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 419 transitions. [2022-07-23 05:28:01,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 05:28:01,843 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 419 transitions. [2022-07-23 05:28:01,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-23 05:28:01,843 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:28:01,843 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:28:01,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-23 05:28:01,844 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 05:28:01,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:28:01,844 INFO L85 PathProgramCache]: Analyzing trace with hash -85479914, now seen corresponding path program 1 times [2022-07-23 05:28:01,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:28:01,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240340468] [2022-07-23 05:28:01,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:28:01,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:28:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:28:01,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 05:28:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:28:02,027 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-23 05:28:02,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:28:02,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240340468] [2022-07-23 05:28:02,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240340468] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:28:02,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:28:02,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 05:28:02,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132522580] [2022-07-23 05:28:02,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:28:02,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 05:28:02,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:28:02,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 05:28:02,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-23 05:28:02,030 INFO L87 Difference]: Start difference. First operand 350 states and 419 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 05:28:02,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:28:02,415 INFO L93 Difference]: Finished difference Result 556 states and 686 transitions. [2022-07-23 05:28:02,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 05:28:02,416 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-07-23 05:28:02,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:28:02,417 INFO L225 Difference]: With dead ends: 556 [2022-07-23 05:28:02,417 INFO L226 Difference]: Without dead ends: 556 [2022-07-23 05:28:02,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-07-23 05:28:02,418 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 273 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:28:02,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 656 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 05:28:02,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-07-23 05:28:02,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 386. [2022-07-23 05:28:02,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 347 states have (on average 1.3112391930835734) internal successors, (455), 374 states have internal predecessors, (455), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 5 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-23 05:28:02,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 474 transitions. [2022-07-23 05:28:02,432 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 474 transitions. Word has length 55 [2022-07-23 05:28:02,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:28:02,432 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 474 transitions. [2022-07-23 05:28:02,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 05:28:02,433 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 474 transitions. [2022-07-23 05:28:02,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-23 05:28:02,436 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:28:02,437 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:28:02,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-23 05:28:02,437 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 05:28:02,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:28:02,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1645084350, now seen corresponding path program 1 times [2022-07-23 05:28:02,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:28:02,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015474141] [2022-07-23 05:28:02,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:28:02,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:28:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:28:02,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 05:28:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:28:02,518 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-23 05:28:02,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:28:02,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015474141] [2022-07-23 05:28:02,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015474141] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:28:02,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:28:02,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 05:28:02,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763145301] [2022-07-23 05:28:02,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:28:02,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 05:28:02,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:28:02,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 05:28:02,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 05:28:02,520 INFO L87 Difference]: Start difference. First operand 386 states and 474 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 05:28:02,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:28:02,677 INFO L93 Difference]: Finished difference Result 441 states and 545 transitions. [2022-07-23 05:28:02,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 05:28:02,678 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-07-23 05:28:02,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:28:02,679 INFO L225 Difference]: With dead ends: 441 [2022-07-23 05:28:02,679 INFO L226 Difference]: Without dead ends: 441 [2022-07-23 05:28:02,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-23 05:28:02,680 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 48 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:28:02,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 597 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:28:02,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2022-07-23 05:28:02,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 421. [2022-07-23 05:28:02,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 382 states have (on average 1.3350785340314135) internal successors, (510), 409 states have internal predecessors, (510), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 5 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-23 05:28:02,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 529 transitions. [2022-07-23 05:28:02,691 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 529 transitions. Word has length 56 [2022-07-23 05:28:02,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:28:02,691 INFO L495 AbstractCegarLoop]: Abstraction has 421 states and 529 transitions. [2022-07-23 05:28:02,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 05:28:02,691 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 529 transitions. [2022-07-23 05:28:02,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-23 05:28:02,692 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:28:02,692 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:28:02,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-23 05:28:02,692 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 05:28:02,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:28:02,693 INFO L85 PathProgramCache]: Analyzing trace with hash -541993187, now seen corresponding path program 1 times [2022-07-23 05:28:02,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:28:02,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055884719] [2022-07-23 05:28:02,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:28:02,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:28:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:28:02,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 05:28:02,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:28:02,788 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-23 05:28:02,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:28:02,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055884719] [2022-07-23 05:28:02,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055884719] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:28:02,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:28:02,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 05:28:02,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666642819] [2022-07-23 05:28:02,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:28:02,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 05:28:02,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:28:02,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 05:28:02,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-23 05:28:02,790 INFO L87 Difference]: Start difference. First operand 421 states and 529 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 05:28:03,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:28:03,025 INFO L93 Difference]: Finished difference Result 560 states and 704 transitions. [2022-07-23 05:28:03,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 05:28:03,025 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2022-07-23 05:28:03,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:28:03,027 INFO L225 Difference]: With dead ends: 560 [2022-07-23 05:28:03,027 INFO L226 Difference]: Without dead ends: 560 [2022-07-23 05:28:03,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-07-23 05:28:03,028 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 179 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:28:03,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 763 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 05:28:03,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2022-07-23 05:28:03,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 421. [2022-07-23 05:28:03,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 382 states have (on average 1.3219895287958114) internal successors, (505), 409 states have internal predecessors, (505), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 5 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-23 05:28:03,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 524 transitions. [2022-07-23 05:28:03,037 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 524 transitions. Word has length 57 [2022-07-23 05:28:03,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:28:03,037 INFO L495 AbstractCegarLoop]: Abstraction has 421 states and 524 transitions. [2022-07-23 05:28:03,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 05:28:03,037 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 524 transitions. [2022-07-23 05:28:03,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-23 05:28:03,038 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:28:03,038 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:28:03,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-23 05:28:03,038 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 05:28:03,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:28:03,039 INFO L85 PathProgramCache]: Analyzing trace with hash 383583177, now seen corresponding path program 1 times [2022-07-23 05:28:03,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:28:03,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407860192] [2022-07-23 05:28:03,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:28:03,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:28:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:28:03,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 05:28:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:28:03,447 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-23 05:28:03,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:28:03,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407860192] [2022-07-23 05:28:03,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407860192] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:28:03,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:28:03,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-07-23 05:28:03,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824577367] [2022-07-23 05:28:03,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:28:03,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-23 05:28:03,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:28:03,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-23 05:28:03,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2022-07-23 05:28:03,449 INFO L87 Difference]: Start difference. First operand 421 states and 524 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 05:28:04,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:28:04,390 INFO L93 Difference]: Finished difference Result 703 states and 878 transitions. [2022-07-23 05:28:04,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-23 05:28:04,390 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-07-23 05:28:04,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:28:04,393 INFO L225 Difference]: With dead ends: 703 [2022-07-23 05:28:04,393 INFO L226 Difference]: Without dead ends: 703 [2022-07-23 05:28:04,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=205, Invalid=1277, Unknown=0, NotChecked=0, Total=1482 [2022-07-23 05:28:04,394 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 592 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-07-23 05:28:04,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 1086 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-23 05:28:04,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2022-07-23 05:28:04,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 458. [2022-07-23 05:28:04,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 419 states have (on average 1.331742243436754) internal successors, (558), 445 states have internal predecessors, (558), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 6 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-23 05:28:04,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 577 transitions. [2022-07-23 05:28:04,407 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 577 transitions. Word has length 58 [2022-07-23 05:28:04,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:28:04,407 INFO L495 AbstractCegarLoop]: Abstraction has 458 states and 577 transitions. [2022-07-23 05:28:04,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 05:28:04,407 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 577 transitions. [2022-07-23 05:28:04,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-23 05:28:04,408 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:28:04,408 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:28:04,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-23 05:28:04,410 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 05:28:04,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:28:04,410 INFO L85 PathProgramCache]: Analyzing trace with hash 383583178, now seen corresponding path program 1 times [2022-07-23 05:28:04,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:28:04,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119024635] [2022-07-23 05:28:04,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:28:04,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:28:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:28:04,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 05:28:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:28:04,837 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-23 05:28:04,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:28:04,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119024635] [2022-07-23 05:28:04,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119024635] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:28:04,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:28:04,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-23 05:28:04,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617657924] [2022-07-23 05:28:04,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:28:04,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-23 05:28:04,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:28:04,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-23 05:28:04,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2022-07-23 05:28:04,838 INFO L87 Difference]: Start difference. First operand 458 states and 577 transitions. Second operand has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 05:28:05,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:28:05,966 INFO L93 Difference]: Finished difference Result 760 states and 937 transitions. [2022-07-23 05:28:05,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-23 05:28:05,967 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-07-23 05:28:05,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:28:05,969 INFO L225 Difference]: With dead ends: 760 [2022-07-23 05:28:05,969 INFO L226 Difference]: Without dead ends: 760 [2022-07-23 05:28:05,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=199, Invalid=1207, Unknown=0, NotChecked=0, Total=1406 [2022-07-23 05:28:05,970 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 627 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 05:28:05,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 914 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-23 05:28:05,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2022-07-23 05:28:05,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 458. [2022-07-23 05:28:05,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 419 states have (on average 1.3269689737470167) internal successors, (556), 445 states have internal predecessors, (556), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (11), 6 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-23 05:28:05,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 575 transitions. [2022-07-23 05:28:05,978 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 575 transitions. Word has length 58 [2022-07-23 05:28:05,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:28:05,978 INFO L495 AbstractCegarLoop]: Abstraction has 458 states and 575 transitions. [2022-07-23 05:28:05,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-23 05:28:05,979 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 575 transitions. [2022-07-23 05:28:05,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-23 05:28:05,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:28:05,979 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:28:05,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-23 05:28:05,980 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-07-23 05:28:05,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:28:05,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1581411742, now seen corresponding path program 1 times [2022-07-23 05:28:05,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:28:05,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253181226] [2022-07-23 05:28:05,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:28:05,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:28:06,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:28:06,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-23 05:28:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:28:06,903 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-23 05:28:06,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:28:06,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253181226] [2022-07-23 05:28:06,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253181226] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:28:06,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109571700] [2022-07-23 05:28:06,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:28:06,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:28:06,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:28:06,905 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:28:06,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-23 05:28:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:28:07,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 124 conjunts are in the unsatisfiable core [2022-07-23 05:28:07,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:28:07,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:28:07,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 05:28:07,370 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 05:28:07,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-23 05:28:07,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 05:28:07,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 05:28:07,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:28:07,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-07-23 05:28:07,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:28:07,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-07-23 05:28:07,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:28:07,785 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-23 05:28:07,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 51 [2022-07-23 05:28:07,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:28:07,799 INFO L356 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2022-07-23 05:28:07,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 46 [2022-07-23 05:28:08,125 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-23 05:28:08,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 72 [2022-07-23 05:28:08,145 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-23 05:28:08,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 96 [2022-07-23 05:28:08,827 INFO L356 Elim1Store]: treesize reduction 68, result has 50.7 percent of original size [2022-07-23 05:28:08,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 105 treesize of output 125 [2022-07-23 05:28:08,893 INFO L356 Elim1Store]: treesize reduction 72, result has 29.4 percent of original size [2022-07-23 05:28:08,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 150 treesize of output 163 [2022-07-23 05:28:09,366 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-23 05:28:09,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-23 05:28:12,052 INFO L356 Elim1Store]: treesize reduction 296, result has 36.9 percent of original size [2022-07-23 05:28:12,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 13 new quantified variables, introduced 45 case distinctions, treesize of input 303 treesize of output 316 [2022-07-23 05:28:12,248 INFO L356 Elim1Store]: treesize reduction 168, result has 54.0 percent of original size [2022-07-23 05:28:12,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 12 new quantified variables, introduced 45 case distinctions, treesize of input 323 treesize of output 453