./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 e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0 --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 68e1c5cf050539b3ee8f058d38ff7af5aea2a400d05e41e0185e4509f45301e0 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 19:46:47,295 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 19:46:47,297 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 19:46:47,318 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 19:46:47,319 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 19:46:47,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 19:46:47,321 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 19:46:47,323 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 19:46:47,325 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 19:46:47,326 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 19:46:47,327 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 19:46:47,329 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 19:46:47,329 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 19:46:47,330 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 19:46:47,332 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 19:46:47,333 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 19:46:47,334 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 19:46:47,335 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 19:46:47,337 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 19:46:47,339 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 19:46:47,341 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 19:46:47,343 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 19:46:47,344 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 19:46:47,345 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 19:46:47,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 19:46:47,349 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 19:46:47,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 19:46:47,350 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 19:46:47,351 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 19:46:47,352 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 19:46:47,352 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 19:46:47,353 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 19:46:47,354 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 19:46:47,355 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 19:46:47,356 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 19:46:47,357 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 19:46:47,358 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 19:46:47,358 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 19:46:47,358 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 19:46:47,360 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 19:46:47,360 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 19:46:47,362 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2022-11-16 19:46:47,386 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 19:46:47,386 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 19:46:47,387 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 19:46:47,387 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 19:46:47,388 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 19:46:47,388 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 19:46:47,388 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-16 19:46:47,389 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-16 19:46:47,389 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-16 19:46:47,389 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-16 19:46:47,389 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-16 19:46:47,390 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-16 19:46:47,390 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-16 19:46:47,390 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-16 19:46:47,390 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-16 19:46:47,391 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-16 19:46:47,391 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-16 19:46:47,391 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-16 19:46:47,392 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 19:46:47,392 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 19:46:47,393 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 19:46:47,393 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 19:46:47,393 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 19:46:47,393 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 19:46:47,394 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 19:46:47,394 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 19:46:47,394 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 19:46:47,394 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 19:46:47,395 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 19:46:47,395 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 19:46:47,395 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 19:46:47,395 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 19:46:47,396 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 19:46:47,396 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 19:46:47,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 19:46:47,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 19:46:47,397 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-16 19:46:47,397 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 19:46:47,397 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-16 19:46:47,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 19:46:47,397 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-16 19:46:47,398 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0 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 -> Taipan 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-11-16 19:46:47,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 19:46:47,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 19:46:47,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 19:46:47,670 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 19:46:47,670 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 19:46:47,672 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i [2022-11-16 19:46:47,752 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/data/5ccc0292d/625d8fcbfbe2491292ef41809646d330/FLAG995641d13 [2022-11-16 19:46:48,275 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 19:46:48,276 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i [2022-11-16 19:46:48,290 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/data/5ccc0292d/625d8fcbfbe2491292ef41809646d330/FLAG995641d13 [2022-11-16 19:46:48,584 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/data/5ccc0292d/625d8fcbfbe2491292ef41809646d330 [2022-11-16 19:46:48,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 19:46:48,588 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 19:46:48,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 19:46:48,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 19:46:48,601 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 19:46:48,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:46:48" (1/1) ... [2022-11-16 19:46:48,605 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ebf8add and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:46:48, skipping insertion in model container [2022-11-16 19:46:48,605 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:46:48" (1/1) ... [2022-11-16 19:46:48,613 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 19:46:48,676 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 19:46:49,136 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i[25013,25026] [2022-11-16 19:46:49,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 19:46:49,155 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 19:46:49,227 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i[25013,25026] [2022-11-16 19:46:49,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 19:46:49,255 INFO L208 MainTranslator]: Completed translation [2022-11-16 19:46:49,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:46:49 WrapperNode [2022-11-16 19:46:49,256 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 19:46:49,257 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 19:46:49,257 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 19:46:49,258 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 19:46:49,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:46:49" (1/1) ... [2022-11-16 19:46:49,286 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:46:49" (1/1) ... [2022-11-16 19:46:49,317 INFO L138 Inliner]: procedures = 129, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 186 [2022-11-16 19:46:49,318 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 19:46:49,318 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 19:46:49,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 19:46:49,319 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 19:46:49,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:46:49" (1/1) ... [2022-11-16 19:46:49,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:46:49" (1/1) ... [2022-11-16 19:46:49,332 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:46:49" (1/1) ... [2022-11-16 19:46:49,333 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:46:49" (1/1) ... [2022-11-16 19:46:49,340 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:46:49" (1/1) ... [2022-11-16 19:46:49,345 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:46:49" (1/1) ... [2022-11-16 19:46:49,347 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:46:49" (1/1) ... [2022-11-16 19:46:49,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:46:49" (1/1) ... [2022-11-16 19:46:49,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 19:46:49,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 19:46:49,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 19:46:49,353 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 19:46:49,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:46:49" (1/1) ... [2022-11-16 19:46:49,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 19:46:49,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:46:49,395 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 19:46:49,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 19:46:49,460 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-16 19:46:49,461 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-16 19:46:49,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 19:46:49,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 19:46:49,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 19:46:49,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 19:46:49,461 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2022-11-16 19:46:49,462 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2022-11-16 19:46:49,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 19:46:49,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 19:46:49,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 19:46:49,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 19:46:49,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 19:46:49,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 19:46:49,593 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 19:46:49,595 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 19:46:49,637 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-16 19:46:50,108 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 19:46:50,179 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 19:46:50,179 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-11-16 19:46:50,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 07:46:50 BoogieIcfgContainer [2022-11-16 19:46:50,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 19:46:50,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 19:46:50,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 19:46:50,201 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 19:46:50,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:46:48" (1/3) ... [2022-11-16 19:46:50,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae514f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:46:50, skipping insertion in model container [2022-11-16 19:46:50,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:46:49" (2/3) ... [2022-11-16 19:46:50,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae514f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:46:50, skipping insertion in model container [2022-11-16 19:46:50,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 07:46:50" (3/3) ... [2022-11-16 19:46:50,204 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-2.i [2022-11-16 19:46:50,223 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 19:46:50,223 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2022-11-16 19:46:50,290 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 19:46:50,298 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6888ea38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 19:46:50,299 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2022-11-16 19:46:50,304 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 51 states have (on average 2.176470588235294) internal successors, (111), 94 states have internal predecessors, (111), 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-11-16 19:46:50,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 19:46:50,318 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:46:50,318 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:46:50,319 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-16 19:46:50,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:46:50,328 INFO L85 PathProgramCache]: Analyzing trace with hash -303362409, now seen corresponding path program 1 times [2022-11-16 19:46:50,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:46:50,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789816353] [2022-11-16 19:46:50,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:46:50,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:46:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:46:50,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:46:50,684 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:46:50,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789816353] [2022-11-16 19:46:50,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789816353] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:46:50,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:46:50,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 19:46:50,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970237675] [2022-11-16 19:46:50,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:46:50,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 19:46:50,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:46:50,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 19:46:50,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 19:46:50,731 INFO L87 Difference]: Start difference. First operand has 99 states, 51 states have (on average 2.176470588235294) internal successors, (111), 94 states have internal predecessors, (111), 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 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-11-16 19:46:50,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:46:50,920 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2022-11-16 19:46:50,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 19:46:50,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 8 [2022-11-16 19:46:50,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:46:50,935 INFO L225 Difference]: With dead ends: 105 [2022-11-16 19:46:50,935 INFO L226 Difference]: Without dead ends: 100 [2022-11-16 19:46:50,937 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-11-16 19:46:50,941 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 5 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 169 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-11-16 19:46:50,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 169 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:46:50,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-16 19:46:50,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2022-11-16 19:46:50,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 50 states have (on average 2.08) internal successors, (104), 91 states have internal predecessors, (104), 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-11-16 19:46:50,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2022-11-16 19:46:50,989 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 8 [2022-11-16 19:46:50,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:46:50,989 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2022-11-16 19:46:50,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-11-16 19:46:50,990 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2022-11-16 19:46:50,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 19:46:50,991 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:46:50,991 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:46:50,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 19:46:50,991 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-16 19:46:50,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:46:50,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1366900647, now seen corresponding path program 1 times [2022-11-16 19:46:50,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:46:50,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062700568] [2022-11-16 19:46:50,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:46:50,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:46:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:46:51,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:46:51,162 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:46:51,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062700568] [2022-11-16 19:46:51,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062700568] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:46:51,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:46:51,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 19:46:51,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118160299] [2022-11-16 19:46:51,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:46:51,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 19:46:51,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:46:51,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 19:46:51,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 19:46:51,166 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 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-11-16 19:46:51,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:46:51,405 INFO L93 Difference]: Finished difference Result 141 states and 158 transitions. [2022-11-16 19:46:51,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 19:46:51,408 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 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-11-16 19:46:51,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:46:51,411 INFO L225 Difference]: With dead ends: 141 [2022-11-16 19:46:51,412 INFO L226 Difference]: Without dead ends: 141 [2022-11-16 19:46:51,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-16 19:46:51,416 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 90 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 19:46:51,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 467 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 19:46:51,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-16 19:46:51,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 118. [2022-11-16 19:46:51,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 71 states have (on average 2.0704225352112675) internal successors, (147), 112 states have internal predecessors, (147), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 19:46:51,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 153 transitions. [2022-11-16 19:46:51,435 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 153 transitions. Word has length 10 [2022-11-16 19:46:51,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:46:51,435 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 153 transitions. [2022-11-16 19:46:51,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 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-11-16 19:46:51,436 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 153 transitions. [2022-11-16 19:46:51,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 19:46:51,436 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:46:51,436 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:46:51,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 19:46:51,437 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-16 19:46:51,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:46:51,438 INFO L85 PathProgramCache]: Analyzing trace with hash 575489218, now seen corresponding path program 1 times [2022-11-16 19:46:51,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:46:51,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076647138] [2022-11-16 19:46:51,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:46:51,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:46:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:46:51,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:46:51,609 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:46:51,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076647138] [2022-11-16 19:46:51,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076647138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:46:51,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:46:51,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 19:46:51,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246348650] [2022-11-16 19:46:51,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:46:51,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 19:46:51,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:46:51,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 19:46:51,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 19:46:51,612 INFO L87 Difference]: Start difference. First operand 118 states and 153 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:46:51,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:46:51,788 INFO L93 Difference]: Finished difference Result 146 states and 184 transitions. [2022-11-16 19:46:51,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 19:46:51,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-16 19:46:51,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:46:51,795 INFO L225 Difference]: With dead ends: 146 [2022-11-16 19:46:51,796 INFO L226 Difference]: Without dead ends: 146 [2022-11-16 19:46:51,797 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-11-16 19:46:51,803 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 32 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:46:51,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 154 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:46:51,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-16 19:46:51,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 117. [2022-11-16 19:46:51,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 71 states have (on average 2.0422535211267605) internal successors, (145), 111 states have internal predecessors, (145), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 19:46:51,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 151 transitions. [2022-11-16 19:46:51,818 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 151 transitions. Word has length 11 [2022-11-16 19:46:51,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:46:51,818 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 151 transitions. [2022-11-16 19:46:51,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:46:51,819 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 151 transitions. [2022-11-16 19:46:51,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 19:46:51,819 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:46:51,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:46:51,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 19:46:51,820 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-16 19:46:51,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:46:51,820 INFO L85 PathProgramCache]: Analyzing trace with hash 575489217, now seen corresponding path program 1 times [2022-11-16 19:46:51,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:46:51,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90148043] [2022-11-16 19:46:51,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:46:51,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:46:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:46:51,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:46:51,913 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:46:51,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90148043] [2022-11-16 19:46:51,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90148043] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:46:51,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:46:51,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 19:46:51,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044282378] [2022-11-16 19:46:51,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:46:51,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 19:46:51,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:46:51,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 19:46:51,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 19:46:51,916 INFO L87 Difference]: Start difference. First operand 117 states and 151 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:46:52,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:46:52,109 INFO L93 Difference]: Finished difference Result 145 states and 182 transitions. [2022-11-16 19:46:52,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 19:46:52,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-16 19:46:52,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:46:52,112 INFO L225 Difference]: With dead ends: 145 [2022-11-16 19:46:52,112 INFO L226 Difference]: Without dead ends: 145 [2022-11-16 19:46:52,113 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-11-16 19:46:52,113 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 31 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 19:46:52,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 149 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 19:46:52,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-16 19:46:52,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 116. [2022-11-16 19:46:52,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 71 states have (on average 2.0140845070422535) internal successors, (143), 110 states have internal predecessors, (143), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 19:46:52,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 149 transitions. [2022-11-16 19:46:52,126 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 149 transitions. Word has length 11 [2022-11-16 19:46:52,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:46:52,127 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 149 transitions. [2022-11-16 19:46:52,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:46:52,127 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 149 transitions. [2022-11-16 19:46:52,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 19:46:52,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:46:52,128 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:46:52,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 19:46:52,128 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-16 19:46:52,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:46:52,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1631077593, now seen corresponding path program 1 times [2022-11-16 19:46:52,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:46:52,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822065142] [2022-11-16 19:46:52,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:46:52,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:46:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:46:52,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:46:52,244 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:46:52,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822065142] [2022-11-16 19:46:52,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822065142] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 19:46:52,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178812279] [2022-11-16 19:46:52,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:46:52,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:46:52,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:46:52,250 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 19:46:52,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 19:46:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:46:52,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 19:46:52,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:46:52,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:46:52,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 19:46:52,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:46:52,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178812279] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 19:46:52,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [235946496] [2022-11-16 19:46:52,536 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2022-11-16 19:46:52,536 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 19:46:52,541 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-16 19:46:52,551 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-16 19:46:52,552 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-16 19:46:52,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:52,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:52,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-16 19:46:53,219 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 30 for LOIs [2022-11-16 19:46:53,257 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-16 19:46:53,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [235946496] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:46:53,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-16 19:46:53,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6, 3, 3] total 17 [2022-11-16 19:46:53,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323576898] [2022-11-16 19:46:53,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:46:53,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 19:46:53,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:46:53,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 19:46:53,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-11-16 19:46:53,755 INFO L87 Difference]: Start difference. First operand 116 states and 149 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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-11-16 19:46:54,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:46:54,258 INFO L93 Difference]: Finished difference Result 131 states and 167 transitions. [2022-11-16 19:46:54,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 19:46:54,259 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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 12 [2022-11-16 19:46:54,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:46:54,260 INFO L225 Difference]: With dead ends: 131 [2022-11-16 19:46:54,260 INFO L226 Difference]: Without dead ends: 131 [2022-11-16 19:46:54,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-11-16 19:46:54,261 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 67 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 19:46:54,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 263 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 19:46:54,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-16 19:46:54,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 120. [2022-11-16 19:46:54,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 75 states have (on average 1.96) internal successors, (147), 113 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 19:46:54,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 153 transitions. [2022-11-16 19:46:54,280 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 153 transitions. Word has length 12 [2022-11-16 19:46:54,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:46:54,280 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 153 transitions. [2022-11-16 19:46:54,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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-11-16 19:46:54,281 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 153 transitions. [2022-11-16 19:46:54,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 19:46:54,282 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:46:54,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:46:54,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 19:46:54,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:46:54,489 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-16 19:46:54,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:46:54,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1005403790, now seen corresponding path program 1 times [2022-11-16 19:46:54,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:46:54,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777083282] [2022-11-16 19:46:54,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:46:54,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:46:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:46:54,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:46:54,642 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:46:54,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777083282] [2022-11-16 19:46:54,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777083282] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 19:46:54,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494431201] [2022-11-16 19:46:54,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:46:54,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:46:54,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:46:54,644 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 19:46:54,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 19:46:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:46:54,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 19:46:54,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:46:54,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:46:54,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 19:46:54,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:46:54,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494431201] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 19:46:54,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [554216520] [2022-11-16 19:46:54,864 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-16 19:46:54,864 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 19:46:54,865 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-16 19:46:54,865 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-16 19:46:54,865 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-16 19:46:54,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:54,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:54,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-16 19:46:54,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:54,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:54,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-16 19:46:54,988 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 62 for LOIs [2022-11-16 19:46:56,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:46:56,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-16 19:46:56,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:46:56,157 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 19:46:56,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2022-11-16 19:46:56,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-11-16 19:46:56,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-16 19:46:56,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:46:56,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:46:56,356 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-16 19:46:58,698 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1523#(and (<= 0 |sll_append_~head#1.offset|) (not (= 0 |sll_append_sll_create_~new_head~0#1.base|)) (<= |sll_append_~sublist_length#1| 3) (<= 0 |sll_append_#in~head#1.base|) (not (= (select |#valid| |sll_append_node_create_with_sublist_~new_node~0#1.base|) 1)) (= 3 |sll_append_#in~sublist_length#1|) (<= |sll_append_node_create_with_sublist_~sublist_length#1| 3) (<= (+ |sll_append_sll_create_~new_head~0#1.offset| 4) (select |#length| |sll_append_sll_create_~new_head~0#1.base|)) (<= 0 |sll_append_~head#1.base|) (= |sll_append_sll_create_#res#1.offset| |sll_append_sll_create_~head~0#1.offset|) (= |sll_append_#in~head#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |sll_append_sll_create_~new_head~0#1.offset|) 0) (= (select |#valid| |sll_append_sll_create_~new_head~0#1.base|) 1) (<= |#NULL.offset| 0) (= |sll_append_sll_create_#res#1.base| |sll_append_sll_create_~head~0#1.base|) (<= 3 |sll_append_node_create_with_sublist_~sublist_length#1|) (not (< 0 |sll_append_sll_create_~len#1|)) (<= 0 |sll_append_sll_create_~head~0#1.offset|) (<= |sll_append_sll_create_~head~0#1.offset| 0) (<= 3 |sll_append_~sublist_length#1|) (<= |sll_append_node_create_with_sublist_#in~sublist_length#1| 3) (<= |sll_append_sll_create_#in~len#1| 3) (= |sll_append_sll_create_#res#1.offset| |sll_append_node_create_with_sublist_#t~ret6#1.offset|) (= |sll_append_sll_create_#res#1.base| |sll_append_node_create_with_sublist_#t~ret6#1.base|) (= |sll_append_sll_create_~head~0#1.base| |sll_append_sll_create_~new_head~0#1.base|) (<= |sll_append_~head#1.offset| 0) (<= 0 |#NULL.offset|) (<= 3 |sll_append_sll_create_#in~len#1|) (= |sll_append_sll_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (= |sll_append_node_create_with_sublist_~new_node~0#1.offset| 0) (<= 3 |sll_append_node_create_with_sublist_#in~sublist_length#1|) (= |#NULL.base| 0))' at error location [2022-11-16 19:46:58,699 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-16 19:46:58,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 19:46:58,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-11-16 19:46:58,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485717654] [2022-11-16 19:46:58,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 19:46:58,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 19:46:58,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:46:58,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 19:46:58,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2022-11-16 19:46:58,701 INFO L87 Difference]: Start difference. First operand 120 states and 153 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:46:59,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:46:59,064 INFO L93 Difference]: Finished difference Result 212 states and 254 transitions. [2022-11-16 19:46:59,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 19:46:59,065 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (3), 2 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 13 [2022-11-16 19:46:59,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:46:59,067 INFO L225 Difference]: With dead ends: 212 [2022-11-16 19:46:59,067 INFO L226 Difference]: Without dead ends: 212 [2022-11-16 19:46:59,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2022-11-16 19:46:59,068 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 232 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 19:46:59,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 968 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 19:46:59,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-11-16 19:46:59,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 119. [2022-11-16 19:46:59,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 75 states have (on average 1.9466666666666668) internal successors, (146), 114 states have internal predecessors, (146), 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-11-16 19:46:59,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 150 transitions. [2022-11-16 19:46:59,087 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 150 transitions. Word has length 13 [2022-11-16 19:46:59,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:46:59,087 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 150 transitions. [2022-11-16 19:46:59,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:46:59,088 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 150 transitions. [2022-11-16 19:46:59,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 19:46:59,089 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:46:59,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:46:59,098 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-16 19:46:59,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-16 19:46:59,294 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-16 19:46:59,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:46:59,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1574251492, now seen corresponding path program 1 times [2022-11-16 19:46:59,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:46:59,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149112787] [2022-11-16 19:46:59,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:46:59,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:46:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:46:59,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 19:46:59,357 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:46:59,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149112787] [2022-11-16 19:46:59,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149112787] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 19:46:59,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503870255] [2022-11-16 19:46:59,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:46:59,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:46:59,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:46:59,359 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 19:46:59,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 19:46:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:46:59,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 19:46:59,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:46:59,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 19:46:59,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 19:46:59,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 19:46:59,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503870255] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 19:46:59,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1632123684] [2022-11-16 19:46:59,507 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-16 19:46:59,508 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 19:46:59,508 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-16 19:46:59,508 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-16 19:46:59,508 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-16 19:46:59,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:59,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:59,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-16 19:46:59,775 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 30 for LOIs [2022-11-16 19:47:00,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:47:00,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:47:00,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-16 19:47:00,415 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 19:47:00,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2022-11-16 19:47:00,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-11-16 19:47:00,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:47:00,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:47:00,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-16 19:47:00,546 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-16 19:47:01,826 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1963#(and (<= 0 |sll_append_~head#1.offset|) (not (= 0 |sll_append_sll_create_~new_head~0#1.base|)) (<= |sll_append_~sublist_length#1| 3) (<= 0 |sll_append_#in~head#1.base|) (not (= (select |#valid| |sll_append_node_create_with_sublist_~new_node~0#1.base|) 1)) (= 3 |sll_append_#in~sublist_length#1|) (<= |sll_append_node_create_with_sublist_~sublist_length#1| 3) (<= (+ |sll_append_sll_create_~new_head~0#1.offset| 4) (select |#length| |sll_append_sll_create_~new_head~0#1.base|)) (<= 0 |sll_append_~head#1.base|) (= |sll_append_sll_create_#res#1.offset| |sll_append_sll_create_~head~0#1.offset|) (= |sll_append_#in~head#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |sll_append_sll_create_~new_head~0#1.offset|) 0) (= (select |#valid| |sll_append_sll_create_~new_head~0#1.base|) 1) (<= |#NULL.offset| 0) (= |sll_append_sll_create_#res#1.base| |sll_append_sll_create_~head~0#1.base|) (<= 3 |sll_append_node_create_with_sublist_~sublist_length#1|) (not (< 0 |sll_append_sll_create_~len#1|)) (<= 0 |sll_append_sll_create_~head~0#1.offset|) (<= |sll_append_sll_create_~head~0#1.offset| 0) (<= 3 |sll_append_~sublist_length#1|) (<= |sll_append_node_create_with_sublist_#in~sublist_length#1| 3) (<= |sll_append_sll_create_#in~len#1| 3) (= |sll_append_sll_create_#res#1.offset| |sll_append_node_create_with_sublist_#t~ret6#1.offset|) (= |sll_append_sll_create_#res#1.base| |sll_append_node_create_with_sublist_#t~ret6#1.base|) (= |sll_append_sll_create_~head~0#1.base| |sll_append_sll_create_~new_head~0#1.base|) (<= |sll_append_~head#1.offset| 0) (<= 0 |#NULL.offset|) (<= 3 |sll_append_sll_create_#in~len#1|) (= |sll_append_sll_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (= |sll_append_node_create_with_sublist_~new_node~0#1.offset| 0) (<= 3 |sll_append_node_create_with_sublist_#in~sublist_length#1|) (= |#NULL.base| 0))' at error location [2022-11-16 19:47:01,827 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-16 19:47:01,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 19:47:01,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-11-16 19:47:01,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139770184] [2022-11-16 19:47:01,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 19:47:01,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 19:47:01,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:47:01,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 19:47:01,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-11-16 19:47:01,829 INFO L87 Difference]: Start difference. First operand 119 states and 150 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 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-11-16 19:47:01,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:47:01,971 INFO L93 Difference]: Finished difference Result 165 states and 201 transitions. [2022-11-16 19:47:01,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 19:47:01,971 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 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 15 [2022-11-16 19:47:01,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:47:01,972 INFO L225 Difference]: With dead ends: 165 [2022-11-16 19:47:01,972 INFO L226 Difference]: Without dead ends: 165 [2022-11-16 19:47:01,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-11-16 19:47:01,973 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 74 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:47:01,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 261 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:47:01,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-16 19:47:01,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 134. [2022-11-16 19:47:01,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 88 states have (on average 1.8409090909090908) internal successors, (162), 127 states have internal predecessors, (162), 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-11-16 19:47:01,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 170 transitions. [2022-11-16 19:47:01,993 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 170 transitions. Word has length 15 [2022-11-16 19:47:01,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:47:01,993 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 170 transitions. [2022-11-16 19:47:01,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 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-11-16 19:47:01,993 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 170 transitions. [2022-11-16 19:47:01,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-16 19:47:01,994 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:47:01,994 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:47:02,005 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 19:47:02,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-16 19:47:02,195 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-16 19:47:02,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:47:02,196 INFO L85 PathProgramCache]: Analyzing trace with hash 13207570, now seen corresponding path program 2 times [2022-11-16 19:47:02,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:47:02,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988513284] [2022-11-16 19:47:02,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:47:02,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:47:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:47:02,378 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 19:47:02,378 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:47:02,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988513284] [2022-11-16 19:47:02,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988513284] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 19:47:02,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771676828] [2022-11-16 19:47:02,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 19:47:02,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:47:02,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:47:02,380 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 19:47:02,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 19:47:02,497 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-16 19:47:02,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 19:47:02,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 19:47:02,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:47:02,507 INFO L350 Elim1Store]: Elim1 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-11-16 19:47:02,528 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 19:47:02,529 INFO L350 Elim1Store]: Elim1 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-11-16 19:47:02,551 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 19:47:02,552 INFO L350 Elim1Store]: Elim1 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-11-16 19:47:02,571 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 19:47:02,571 INFO L350 Elim1Store]: Elim1 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-11-16 19:47:02,586 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 19:47:02,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 19:47:02,703 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 19:47:02,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771676828] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 19:47:02,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1969540153] [2022-11-16 19:47:02,705 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-16 19:47:02,706 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 19:47:02,706 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-16 19:47:02,706 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-16 19:47:02,706 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-16 19:47:02,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:02,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:02,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-16 19:47:02,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:02,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:02,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-16 19:47:02,796 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 62 for LOIs [2022-11-16 19:47:03,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:47:03,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:47:03,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-16 19:47:03,584 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 19:47:03,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-16 19:47:03,615 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 19:47:03,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2022-11-16 19:47:03,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:47:03,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:47:03,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-16 19:47:03,752 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-16 19:47:05,715 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2388#(and (<= 0 |sll_append_~head#1.offset|) (not (= 0 |sll_append_sll_create_~new_head~0#1.base|)) (<= |sll_append_~sublist_length#1| 3) (<= 0 |sll_append_#in~head#1.base|) (not (= (select |#valid| |sll_append_node_create_with_sublist_~new_node~0#1.base|) 1)) (<= |sll_append_#in~sublist_length#1| 3) (<= |sll_append_node_create_with_sublist_~new_node~0#1.offset| 0) (<= |sll_append_#in~head#1.offset| 0) (<= |sll_append_node_create_with_sublist_~sublist_length#1| 3) (<= (+ |sll_append_sll_create_~new_head~0#1.offset| 4) (select |#length| |sll_append_sll_create_~new_head~0#1.base|)) (<= 0 |sll_append_~head#1.base|) (<= 0 |sll_append_sll_create_~new_head~0#1.offset|) (= |sll_append_sll_create_#res#1.offset| |sll_append_sll_create_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |sll_append_sll_create_~new_head~0#1.offset|) 0) (= (select |#valid| |sll_append_sll_create_~new_head~0#1.base|) 1) (<= |#NULL.offset| 0) (<= 0 |sll_append_node_create_with_sublist_~new_node~0#1.offset|) (= |sll_append_sll_create_#res#1.base| |sll_append_sll_create_~head~0#1.base|) (<= 3 |sll_append_node_create_with_sublist_~sublist_length#1|) (not (< 0 |sll_append_sll_create_~len#1|)) (<= 0 |sll_append_sll_create_~head~0#1.offset|) (<= |sll_append_sll_create_~head~0#1.offset| 0) (<= 3 |sll_append_~sublist_length#1|) (<= |sll_append_node_create_with_sublist_#in~sublist_length#1| 3) (<= |sll_append_sll_create_#in~len#1| 3) (<= |sll_append_sll_create_~new_head~0#1.offset| 0) (= |sll_append_sll_create_#res#1.offset| |sll_append_node_create_with_sublist_#t~ret6#1.offset|) (= |sll_append_sll_create_#res#1.base| |sll_append_node_create_with_sublist_#t~ret6#1.base|) (<= 3 |sll_append_#in~sublist_length#1|) (<= 0 |sll_append_#in~head#1.offset|) (= |sll_append_sll_create_~head~0#1.base| |sll_append_sll_create_~new_head~0#1.base|) (<= |sll_append_~head#1.offset| 0) (<= 0 |#NULL.offset|) (<= 3 |sll_append_sll_create_#in~len#1|) (<= 0 |#StackHeapBarrier|) (<= 3 |sll_append_node_create_with_sublist_#in~sublist_length#1|) (= |#NULL.base| 0))' at error location [2022-11-16 19:47:05,715 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-16 19:47:05,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 19:47:05,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-11-16 19:47:05,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755754663] [2022-11-16 19:47:05,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 19:47:05,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 19:47:05,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:47:05,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 19:47:05,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-11-16 19:47:05,717 INFO L87 Difference]: Start difference. First operand 134 states and 170 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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-11-16 19:47:05,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:47:05,784 INFO L93 Difference]: Finished difference Result 132 states and 166 transitions. [2022-11-16 19:47:05,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 19:47:05,785 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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 19 [2022-11-16 19:47:05,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:47:05,786 INFO L225 Difference]: With dead ends: 132 [2022-11-16 19:47:05,786 INFO L226 Difference]: Without dead ends: 132 [2022-11-16 19:47:05,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-11-16 19:47:05,787 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 88 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:47:05,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 180 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 31 Unchecked, 0.1s Time] [2022-11-16 19:47:05,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-16 19:47:05,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-11-16 19:47:05,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 88 states have (on average 1.7954545454545454) internal successors, (158), 125 states have internal predecessors, (158), 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-11-16 19:47:05,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 166 transitions. [2022-11-16 19:47:05,793 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 166 transitions. Word has length 19 [2022-11-16 19:47:05,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:47:05,794 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 166 transitions. [2022-11-16 19:47:05,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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-11-16 19:47:05,794 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 166 transitions. [2022-11-16 19:47:05,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-16 19:47:05,795 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:47:05,795 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:47:05,807 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 19:47:06,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:47:06,001 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-11-16 19:47:06,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:47:06,002 INFO L85 PathProgramCache]: Analyzing trace with hash 13207571, now seen corresponding path program 1 times [2022-11-16 19:47:06,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:47:06,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596049146] [2022-11-16 19:47:06,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:47:06,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:47:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:47:06,230 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 19:47:06,230 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:47:06,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596049146] [2022-11-16 19:47:06,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596049146] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 19:47:06,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286118448] [2022-11-16 19:47:06,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:47:06,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:47:06,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:47:06,235 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 19:47:06,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 19:47:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:47:06,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-16 19:47:06,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:47:06,377 INFO L350 Elim1Store]: Elim1 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-11-16 19:47:06,383 INFO L350 Elim1Store]: Elim1 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-11-16 19:47:06,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:06,416 INFO L350 Elim1Store]: Elim1 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-11-16 19:47:06,432 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 19:47:06,433 INFO L350 Elim1Store]: Elim1 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-11-16 19:47:06,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:06,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 19:47:06,550 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-16 19:47:06,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-16 19:47:06,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:06,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-11-16 19:47:06,692 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-16 19:47:06,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-11-16 19:47:06,718 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:47:06,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 19:47:13,850 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:47:13,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286118448] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 19:47:13,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2060604962] [2022-11-16 19:47:13,853 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-16 19:47:13,853 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 19:47:13,853 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-16 19:47:13,854 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-16 19:47:13,854 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-16 19:47:13,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:13,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:13,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-16 19:47:13,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:13,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:13,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-16 19:47:13,944 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 62 for LOIs [2022-11-16 19:47:14,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-16 19:47:14,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:47:14,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:47:14,662 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 19:47:14,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-16 19:47:14,689 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 19:47:14,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2022-11-16 19:47:14,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:47:14,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-16 19:47:14,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:47:14,814 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-16 19:47:17,006 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2783#(and (<= 0 |sll_append_~head#1.offset|) (not (= 0 |sll_append_sll_create_~new_head~0#1.base|)) (<= |sll_append_~sublist_length#1| 3) (<= 0 |sll_append_#in~head#1.base|) (= 3 |sll_append_#in~sublist_length#1|) (<= |sll_append_node_create_with_sublist_~sublist_length#1| 3) (<= (+ |sll_append_sll_create_~new_head~0#1.offset| 4) (select |#length| |sll_append_sll_create_~new_head~0#1.base|)) (<= 0 |sll_append_~head#1.base|) (< (select |#length| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 8)) (= |sll_append_sll_create_#res#1.offset| |sll_append_sll_create_~head~0#1.offset|) (= |sll_append_#in~head#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |sll_append_sll_create_~new_head~0#1.offset|) 0) (= (select |#valid| |sll_append_sll_create_~new_head~0#1.base|) 1) (<= |#NULL.offset| 0) (= |sll_append_sll_create_#res#1.base| |sll_append_sll_create_~head~0#1.base|) (<= 3 |sll_append_node_create_with_sublist_~sublist_length#1|) (not (< 0 |sll_append_sll_create_~len#1|)) (<= 0 |sll_append_sll_create_~head~0#1.offset|) (<= |sll_append_sll_create_~head~0#1.offset| 0) (<= 3 |sll_append_~sublist_length#1|) (<= |sll_append_node_create_with_sublist_#in~sublist_length#1| 3) (<= |sll_append_sll_create_#in~len#1| 3) (= |sll_append_sll_create_#res#1.offset| |sll_append_node_create_with_sublist_#t~ret6#1.offset|) (= |sll_append_sll_create_#res#1.base| |sll_append_node_create_with_sublist_#t~ret6#1.base|) (= |sll_append_sll_create_~head~0#1.base| |sll_append_sll_create_~new_head~0#1.base|) (<= |sll_append_~head#1.offset| 0) (<= 0 |#NULL.offset|) (<= 3 |sll_append_sll_create_#in~len#1|) (= |sll_append_sll_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (= |sll_append_node_create_with_sublist_~new_node~0#1.offset| 0) (<= 3 |sll_append_node_create_with_sublist_#in~sublist_length#1|) (= |#NULL.base| 0))' at error location [2022-11-16 19:47:17,006 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-16 19:47:17,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 19:47:17,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 12 [2022-11-16 19:47:17,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965150646] [2022-11-16 19:47:17,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 19:47:17,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 19:47:17,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:47:17,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 19:47:17,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2022-11-16 19:47:17,008 INFO L87 Difference]: Start difference. First operand 132 states and 166 transitions. Second operand has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 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-11-16 19:47:17,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:47:17,278 INFO L93 Difference]: Finished difference Result 133 states and 166 transitions. [2022-11-16 19:47:17,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 19:47:17,279 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 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 19 [2022-11-16 19:47:17,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:47:17,280 INFO L225 Difference]: With dead ends: 133 [2022-11-16 19:47:17,280 INFO L226 Difference]: Without dead ends: 133 [2022-11-16 19:47:17,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=153, Invalid=549, Unknown=0, NotChecked=0, Total=702 [2022-11-16 19:47:17,284 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 83 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:47:17,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 196 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 75 Invalid, 0 Unknown, 128 Unchecked, 0.1s Time] [2022-11-16 19:47:17,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-16 19:47:17,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 130. [2022-11-16 19:47:17,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 88 states have (on average 1.75) internal successors, (154), 123 states have internal predecessors, (154), 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-11-16 19:47:17,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 162 transitions. [2022-11-16 19:47:17,299 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 162 transitions. Word has length 19 [2022-11-16 19:47:17,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:47:17,300 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 162 transitions. [2022-11-16 19:47:17,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 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-11-16 19:47:17,300 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 162 transitions. [2022-11-16 19:47:17,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-16 19:47:17,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:47:17,304 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:47:17,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 19:47:17,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:47:17,513 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-11-16 19:47:17,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:47:17,513 INFO L85 PathProgramCache]: Analyzing trace with hash -192183934, now seen corresponding path program 1 times [2022-11-16 19:47:17,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:47:17,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007398524] [2022-11-16 19:47:17,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:47:17,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:47:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:47:17,627 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 19:47:17,628 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:47:17,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007398524] [2022-11-16 19:47:17,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007398524] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:47:17,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:47:17,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 19:47:17,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096444655] [2022-11-16 19:47:17,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:47:17,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 19:47:17,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:47:17,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 19:47:17,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 19:47:17,631 INFO L87 Difference]: Start difference. First operand 130 states and 162 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-11-16 19:47:17,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:47:17,733 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2022-11-16 19:47:17,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 19:47:17,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 21 [2022-11-16 19:47:17,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:47:17,736 INFO L225 Difference]: With dead ends: 129 [2022-11-16 19:47:17,736 INFO L226 Difference]: Without dead ends: 129 [2022-11-16 19:47:17,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-11-16 19:47:17,737 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 50 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:47:17,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 144 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:47:17,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-16 19:47:17,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-11-16 19:47:17,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 88 states have (on average 1.7272727272727273) internal successors, (152), 122 states have internal predecessors, (152), 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-11-16 19:47:17,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 160 transitions. [2022-11-16 19:47:17,743 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 160 transitions. Word has length 21 [2022-11-16 19:47:17,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:47:17,745 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 160 transitions. [2022-11-16 19:47:17,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-11-16 19:47:17,746 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 160 transitions. [2022-11-16 19:47:17,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-16 19:47:17,753 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:47:17,753 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:47:17,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 19:47:17,753 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-11-16 19:47:17,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:47:17,754 INFO L85 PathProgramCache]: Analyzing trace with hash -192183933, now seen corresponding path program 1 times [2022-11-16 19:47:17,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:47:17,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332936581] [2022-11-16 19:47:17,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:47:17,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:47:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:47:17,911 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 19:47:17,912 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:47:17,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332936581] [2022-11-16 19:47:17,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332936581] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:47:17,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:47:17,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 19:47:17,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507649027] [2022-11-16 19:47:17,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:47:17,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 19:47:17,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:47:17,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 19:47:17,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:47:17,914 INFO L87 Difference]: Start difference. First operand 129 states and 160 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-11-16 19:47:18,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:47:18,023 INFO L93 Difference]: Finished difference Result 128 states and 158 transitions. [2022-11-16 19:47:18,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 19:47:18,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 21 [2022-11-16 19:47:18,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:47:18,025 INFO L225 Difference]: With dead ends: 128 [2022-11-16 19:47:18,025 INFO L226 Difference]: Without dead ends: 128 [2022-11-16 19:47:18,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-16 19:47:18,026 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 49 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:47:18,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 207 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:47:18,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-16 19:47:18,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-11-16 19:47:18,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 88 states have (on average 1.7045454545454546) internal successors, (150), 121 states have internal predecessors, (150), 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-11-16 19:47:18,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2022-11-16 19:47:18,031 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 158 transitions. Word has length 21 [2022-11-16 19:47:18,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:47:18,031 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 158 transitions. [2022-11-16 19:47:18,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-11-16 19:47:18,032 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2022-11-16 19:47:18,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 19:47:18,032 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:47:18,032 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:47:18,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 19:47:18,033 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-11-16 19:47:18,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:47:18,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1662734635, now seen corresponding path program 1 times [2022-11-16 19:47:18,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:47:18,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856604175] [2022-11-16 19:47:18,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:47:18,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:47:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:47:18,427 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 19:47:18,427 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:47:18,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856604175] [2022-11-16 19:47:18,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856604175] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 19:47:18,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308177677] [2022-11-16 19:47:18,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:47:18,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:47:18,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:47:18,429 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 19:47:18,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 19:47:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:47:18,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-16 19:47:18,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:47:18,573 INFO L350 Elim1Store]: Elim1 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-11-16 19:47:18,612 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 19:47:18,612 INFO L350 Elim1Store]: Elim1 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-11-16 19:47:18,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:18,653 INFO L350 Elim1Store]: Elim1 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-11-16 19:47:18,677 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 19:47:18,678 INFO L350 Elim1Store]: Elim1 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-11-16 19:47:18,759 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-11-16 19:47:18,759 INFO L350 Elim1Store]: Elim1 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-11-16 19:47:18,868 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 19:47:18,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 19:47:19,141 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 19:47:19,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308177677] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 19:47:19,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1717270610] [2022-11-16 19:47:19,144 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-16 19:47:19,144 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 19:47:19,144 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-16 19:47:19,145 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-16 19:47:19,145 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-16 19:47:19,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:19,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:19,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-16 19:47:19,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:19,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:19,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-16 19:47:19,230 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 62 for LOIs [2022-11-16 19:47:19,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:47:19,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-16 19:47:19,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:47:19,983 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 19:47:19,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-16 19:47:20,013 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 19:47:20,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2022-11-16 19:47:20,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-16 19:47:20,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:47:20,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:47:20,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 19:47:20,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:20,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-16 19:47:20,321 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 1 [2022-11-16 19:47:20,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:20,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-16 19:47:20,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:20,494 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 19:47:20,495 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 30 [2022-11-16 19:47:20,543 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 1 [2022-11-16 19:47:20,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:20,648 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-16 19:47:20,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:20,705 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-16 19:47:20,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 33 [2022-11-16 19:47:20,731 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 1 [2022-11-16 19:47:20,873 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-16 19:47:23,956 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3733#(and (= |sll_append_node_create_with_sublist_#res#1.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (= |sll_append_node_create_with_sublist_#res#1.base| |sll_append_~new_last~0#1.base|) (<= 0 |sll_append_~head#1.offset|) (not (= 0 |sll_append_sll_create_~new_head~0#1.base|)) (<= |sll_append_~sublist_length#1| 3) (<= 0 |sll_append_#in~head#1.base|) (= 3 |sll_append_#in~sublist_length#1|) (<= |sll_append_node_create_with_sublist_~sublist_length#1| 3) (<= (+ |sll_append_sll_create_~new_head~0#1.offset| 4) (select |#length| |sll_append_sll_create_~new_head~0#1.base|)) (<= 0 |sll_append_~head#1.base|) (= |sll_append_sll_create_#res#1.offset| (select (select |#memory_$Pointer$.offset| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= |sll_append_sll_create_~len#1| 0) (= |sll_append_sll_create_#res#1.offset| |sll_append_sll_create_~head~0#1.offset|) (= |sll_append_#in~head#1.offset| 0) (<= (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 8) (select |#length| |sll_append_node_create_with_sublist_~new_node~0#1.base|)) (= |sll_append_node_create_with_sublist_#res#1.offset| |sll_append_~new_last~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |sll_append_sll_create_~new_head~0#1.offset|) 0) (= (select |#valid| |sll_append_sll_create_~new_head~0#1.base|) 1) (not (= (select |#valid| |sll_append_~head#1.base|) 1)) (= |sll_append_sll_create_#res#1.base| |sll_append_sll_create_~head~0#1.base|) (<= 3 |sll_append_node_create_with_sublist_~sublist_length#1|) (<= 3 |sll_append_~sublist_length#1|) (<= |sll_append_node_create_with_sublist_#in~sublist_length#1| 3) (<= |sll_append_sll_create_#in~len#1| 3) (= |sll_append_sll_create_~new_head~0#1.offset| |sll_append_sll_create_~head~0#1.offset|) (= |#NULL.offset| 0) (= |sll_append_node_create_with_sublist_#res#1.offset| |sll_append_node_create_with_sublist_~new_node~0#1.offset|) (= |sll_append_sll_create_~head~0#1.base| |sll_append_sll_create_~new_head~0#1.base|) (= (select |#valid| |sll_append_node_create_with_sublist_~new_node~0#1.base|) 1) (<= |sll_append_~head#1.offset| 0) (= |sll_append_sll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= 3 |sll_append_sll_create_#in~len#1|) (= |sll_append_sll_create_~new_head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |sll_append_node_create_with_sublist_~new_node~0#1.base|) |sll_append_node_create_with_sublist_~new_node~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) |sll_append_node_create_with_sublist_~new_node~0#1.offset|) 0) (<= 0 |#StackHeapBarrier|) (= |sll_append_node_create_with_sublist_~new_node~0#1.offset| 0) (<= 3 |sll_append_node_create_with_sublist_#in~sublist_length#1|) (= |#NULL.base| 0))' at error location [2022-11-16 19:47:23,956 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-16 19:47:23,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 19:47:23,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-11-16 19:47:23,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710783302] [2022-11-16 19:47:23,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 19:47:23,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 19:47:23,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:47:23,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 19:47:23,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2022-11-16 19:47:23,959 INFO L87 Difference]: Start difference. First operand 128 states and 158 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 11 states have internal predecessors, (45), 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-11-16 19:47:24,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:47:24,201 INFO L93 Difference]: Finished difference Result 176 states and 215 transitions. [2022-11-16 19:47:24,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 19:47:24,201 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 11 states have internal predecessors, (45), 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 22 [2022-11-16 19:47:24,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:47:24,202 INFO L225 Difference]: With dead ends: 176 [2022-11-16 19:47:24,203 INFO L226 Difference]: Without dead ends: 176 [2022-11-16 19:47:24,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2022-11-16 19:47:24,204 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 91 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 204 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 19:47:24,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 349 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 167 Invalid, 0 Unknown, 204 Unchecked, 0.2s Time] [2022-11-16 19:47:24,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-11-16 19:47:24,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 167. [2022-11-16 19:47:24,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 124 states have (on average 1.6048387096774193) internal successors, (199), 159 states have internal predecessors, (199), 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-11-16 19:47:24,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 213 transitions. [2022-11-16 19:47:24,210 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 213 transitions. Word has length 22 [2022-11-16 19:47:24,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:47:24,211 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 213 transitions. [2022-11-16 19:47:24,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 11 states have internal predecessors, (45), 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-11-16 19:47:24,211 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 213 transitions. [2022-11-16 19:47:24,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 19:47:24,212 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:47:24,212 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:47:24,223 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 19:47:24,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-16 19:47:24,413 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-11-16 19:47:24,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:47:24,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1662734634, now seen corresponding path program 1 times [2022-11-16 19:47:24,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:47:24,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108058547] [2022-11-16 19:47:24,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:47:24,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:47:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:47:24,873 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 19:47:24,874 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:47:24,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108058547] [2022-11-16 19:47:24,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108058547] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 19:47:24,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269432954] [2022-11-16 19:47:24,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:47:24,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:47:24,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:47:24,876 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 19:47:24,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 19:47:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:47:25,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-16 19:47:25,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:47:25,034 INFO L350 Elim1Store]: Elim1 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-11-16 19:47:25,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:25,104 INFO L350 Elim1Store]: Elim1 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-11-16 19:47:25,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:25,141 INFO L350 Elim1Store]: Elim1 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-11-16 19:47:25,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:25,164 INFO L350 Elim1Store]: Elim1 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-11-16 19:47:25,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:25,191 INFO L350 Elim1Store]: Elim1 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-11-16 19:47:25,221 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 19:47:25,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 19:47:27,409 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_472 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_473 Int)) (<= (+ |c_sll_append_~head#1.offset| 4) (select (store (store |c_#length| |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_472) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_473) |c_sll_append_~head#1.base|))))))) (<= 0 |c_sll_append_~head#1.offset|)) is different from false [2022-11-16 19:47:29,505 WARN L833 $PredicateComparison]: unable to prove that (and (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_471 Int) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (forall ((v_ArrVal_472 Int) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_473 Int)) (<= (+ |c_sll_append_~head#1.offset| 4) (select (store (store (store |c_#length| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_471) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_472) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_473) |c_sll_append_~head#1.base|))) (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|)))))) (<= 0 |c_sll_append_~head#1.offset|)) is different from false [2022-11-16 19:47:31,614 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 |c_sll_append_#in~head#1.offset|) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_24| Int)) (or (forall ((v_ArrVal_470 Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (forall ((v_ArrVal_471 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_472 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_473 Int)) (<= (+ |c_sll_append_#in~head#1.offset| 4) (select (store (store (store (store |c_#length| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_24| v_ArrVal_470) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_471) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_472) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_473) |c_sll_append_#in~head#1.base|))))))) (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_24| |c_#StackHeapBarrier|))))) is different from false [2022-11-16 19:47:33,671 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_24| Int)) (or (forall ((v_ArrVal_470 Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_471 Int) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (forall ((v_ArrVal_472 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_473 Int)) (<= (+ 4 |c_ULTIMATE.start_main_~#head~1#1.offset|) (select (store (store (store (store |c_#length| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_24| v_ArrVal_470) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_471) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_472) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_473) |c_ULTIMATE.start_main_~#head~1#1.base|))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_24| |c_#StackHeapBarrier|)))) (<= 0 |c_ULTIMATE.start_main_~#head~1#1.offset|)) is different from false [2022-11-16 19:47:33,785 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-16 19:47:33,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269432954] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 19:47:33,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1523124907] [2022-11-16 19:47:33,788 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-16 19:47:33,788 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 19:47:33,788 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-16 19:47:33,788 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-16 19:47:33,789 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-16 19:47:33,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:33,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:33,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-16 19:47:33,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:33,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:33,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-16 19:47:33,867 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 62 for LOIs [2022-11-16 19:47:34,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:47:34,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:47:34,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-16 19:47:34,548 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 19:47:34,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-16 19:47:34,574 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 19:47:34,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2022-11-16 19:47:34,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:47:34,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:47:34,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-16 19:47:34,735 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 1 [2022-11-16 19:47:34,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:34,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-16 19:47:34,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 19:47:34,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:34,952 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 19:47:34,952 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 30 [2022-11-16 19:47:34,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:34,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-16 19:47:35,019 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 1 [2022-11-16 19:47:35,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:35,118 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-16 19:47:35,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:35,188 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-16 19:47:35,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 33 [2022-11-16 19:47:35,235 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 1 [2022-11-16 19:47:35,315 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-16 19:47:38,386 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4233#(and (= |sll_append_node_create_with_sublist_#res#1.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (= |sll_append_node_create_with_sublist_#res#1.base| |sll_append_~new_last~0#1.base|) (<= 0 |sll_append_~head#1.offset|) (not (= 0 |sll_append_sll_create_~new_head~0#1.base|)) (<= |sll_append_~sublist_length#1| 3) (<= 0 |sll_append_#in~head#1.base|) (= 3 |sll_append_#in~sublist_length#1|) (<= |sll_append_node_create_with_sublist_~sublist_length#1| 3) (<= (+ |sll_append_sll_create_~new_head~0#1.offset| 4) (select |#length| |sll_append_sll_create_~new_head~0#1.base|)) (<= 0 |sll_append_~head#1.base|) (= |sll_append_sll_create_#res#1.offset| (select (select |#memory_$Pointer$.offset| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= 0 |sll_append_sll_create_~new_head~0#1.offset|) (<= |sll_append_sll_create_~len#1| 0) (= |sll_append_sll_create_#res#1.offset| |sll_append_sll_create_~head~0#1.offset|) (= |sll_append_#in~head#1.offset| 0) (<= (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 8) (select |#length| |sll_append_node_create_with_sublist_~new_node~0#1.base|)) (= |sll_append_node_create_with_sublist_#res#1.offset| |sll_append_~new_last~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |sll_append_sll_create_~new_head~0#1.offset|) 0) (= (select |#valid| |sll_append_sll_create_~new_head~0#1.base|) 1) (<= |#NULL.offset| 0) (= |sll_append_sll_create_#res#1.base| |sll_append_sll_create_~head~0#1.base|) (<= 3 |sll_append_node_create_with_sublist_~sublist_length#1|) (<= 0 |sll_append_sll_create_~head~0#1.offset|) (< (select |#length| |sll_append_~head#1.base|) (+ |sll_append_~head#1.offset| 4)) (<= |sll_append_sll_create_~head~0#1.offset| 0) (<= 3 |sll_append_~sublist_length#1|) (<= |sll_append_node_create_with_sublist_#in~sublist_length#1| 3) (<= |sll_append_sll_create_#in~len#1| 3) (<= |sll_append_sll_create_~new_head~0#1.offset| 0) (= |sll_append_node_create_with_sublist_#res#1.offset| |sll_append_node_create_with_sublist_~new_node~0#1.offset|) (= |sll_append_sll_create_~head~0#1.base| |sll_append_sll_create_~new_head~0#1.base|) (= (select |#valid| |sll_append_node_create_with_sublist_~new_node~0#1.base|) 1) (<= |sll_append_~head#1.offset| 0) (= |sll_append_sll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= 0 |#NULL.offset|) (<= 3 |sll_append_sll_create_#in~len#1|) (= (select (select |#memory_$Pointer$.offset| |sll_append_node_create_with_sublist_~new_node~0#1.base|) |sll_append_node_create_with_sublist_~new_node~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) |sll_append_node_create_with_sublist_~new_node~0#1.offset|) 0) (<= 0 |#StackHeapBarrier|) (= |sll_append_node_create_with_sublist_~new_node~0#1.offset| 0) (<= 3 |sll_append_node_create_with_sublist_#in~sublist_length#1|) (= |#NULL.base| 0))' at error location [2022-11-16 19:47:38,386 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-16 19:47:38,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 19:47:38,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 6] total 12 [2022-11-16 19:47:38,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778657212] [2022-11-16 19:47:38,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 19:47:38,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 19:47:38,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:47:38,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 19:47:38,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=385, Unknown=4, NotChecked=172, Total=650 [2022-11-16 19:47:38,388 INFO L87 Difference]: Start difference. First operand 167 states and 213 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 10 states have internal predecessors, (45), 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-11-16 19:47:38,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:47:38,793 INFO L93 Difference]: Finished difference Result 184 states and 228 transitions. [2022-11-16 19:47:38,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 19:47:38,794 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 10 states have internal predecessors, (45), 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 22 [2022-11-16 19:47:38,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:47:38,795 INFO L225 Difference]: With dead ends: 184 [2022-11-16 19:47:38,795 INFO L226 Difference]: Without dead ends: 184 [2022-11-16 19:47:38,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=98, Invalid=420, Unknown=4, NotChecked=180, Total=702 [2022-11-16 19:47:38,796 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 146 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 455 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 19:47:38,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 161 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 277 Invalid, 0 Unknown, 455 Unchecked, 0.3s Time] [2022-11-16 19:47:38,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-11-16 19:47:38,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 161. [2022-11-16 19:47:38,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 124 states have (on average 1.5241935483870968) internal successors, (189), 153 states have internal predecessors, (189), 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-11-16 19:47:38,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 203 transitions. [2022-11-16 19:47:38,806 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 203 transitions. Word has length 22 [2022-11-16 19:47:38,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:47:38,808 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 203 transitions. [2022-11-16 19:47:38,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 10 states have internal predecessors, (45), 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-11-16 19:47:38,809 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 203 transitions. [2022-11-16 19:47:38,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 19:47:38,809 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:47:38,810 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:47:38,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 19:47:39,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-16 19:47:39,016 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-11-16 19:47:39,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:47:39,016 INFO L85 PathProgramCache]: Analyzing trace with hash -159940653, now seen corresponding path program 1 times [2022-11-16 19:47:39,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:47:39,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598298561] [2022-11-16 19:47:39,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:47:39,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:47:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:47:39,790 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 19:47:39,790 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:47:39,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598298561] [2022-11-16 19:47:39,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598298561] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 19:47:39,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151476191] [2022-11-16 19:47:39,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:47:39,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:47:39,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:47:39,792 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 19:47:39,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 19:47:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:47:39,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-16 19:47:39,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:47:40,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:40,153 INFO L350 Elim1Store]: Elim1 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-11-16 19:47:40,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:40,163 INFO L350 Elim1Store]: Elim1 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-11-16 19:47:40,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:40,289 INFO L350 Elim1Store]: Elim1 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-11-16 19:47:40,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:40,299 INFO L350 Elim1Store]: Elim1 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-11-16 19:47:40,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:40,475 INFO L350 Elim1Store]: Elim1 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-11-16 19:47:40,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:40,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:40,498 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 19:47:40,498 INFO L350 Elim1Store]: Elim1 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-11-16 19:47:40,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:40,605 INFO L350 Elim1Store]: Elim1 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-11-16 19:47:40,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:40,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:40,639 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 19:47:40,639 INFO L350 Elim1Store]: Elim1 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-11-16 19:47:40,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:40,700 INFO L350 Elim1Store]: Elim1 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-11-16 19:47:40,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:40,710 INFO L350 Elim1Store]: Elim1 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-11-16 19:47:40,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:40,748 INFO L350 Elim1Store]: Elim1 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-11-16 19:47:40,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:40,753 INFO L350 Elim1Store]: Elim1 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-11-16 19:47:40,785 INFO L350 Elim1Store]: Elim1 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-11-16 19:47:40,790 INFO L350 Elim1Store]: Elim1 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-11-16 19:47:40,792 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:47:40,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 19:47:40,885 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_578 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_578) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_579 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_579) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-11-16 19:47:40,906 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_579 (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_579) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_571 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_571) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_578) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-11-16 19:47:45,228 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_579 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_55| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_55|) 0 |c_sll_append_sll_create_~head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_54| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_54|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_579) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (v_ArrVal_569 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_571 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_569) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_571) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_578) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))))) is different from false [2022-11-16 19:47:47,269 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_55| Int) (v_ArrVal_566 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_579 (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_566))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_55| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_55|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_54| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_54|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_579) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))))) (forall ((v_ArrVal_567 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (v_ArrVal_569 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_571 (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_567) |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_569) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_571) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_578) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))))) is different from false [2022-11-16 19:47:49,338 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_56| Int)) (or (forall ((v_ArrVal_567 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (v_ArrVal_569 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_571 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_56| v_ArrVal_567) |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_569) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_571) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_578) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_56| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_56| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_55| Int) (v_ArrVal_566 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_579 (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_56| v_ArrVal_566))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_55| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_55|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_54| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_54|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_579) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_56| |c_#StackHeapBarrier|))))) is different from false [2022-11-16 19:47:51,504 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_56| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_56| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_55| Int) (v_ArrVal_566 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int)) (or (forall ((v_ArrVal_579 (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_56| v_ArrVal_566))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_55| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_55|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_54| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_54|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| v_ArrVal_579) |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_54| |c_#StackHeapBarrier|)))))))))) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_56| Int)) (or (forall ((v_ArrVal_567 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (v_ArrVal_569 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_571 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_56| v_ArrVal_567) |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_569) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_571) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| v_ArrVal_578) |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_56| |c_#StackHeapBarrier|))))))) is different from false [2022-11-16 19:47:53,591 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_56| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_55| Int) (v_ArrVal_566 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int)) (or (forall ((v_ArrVal_579 (Array Int Int))) (= 0 (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_56| v_ArrVal_566))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_55| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_55|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_54| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_54|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| v_ArrVal_579) |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_54| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_56| |c_#StackHeapBarrier|)))))) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_56| Int)) (or (forall ((v_ArrVal_567 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (v_ArrVal_569 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_571 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_56| v_ArrVal_567) |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_569) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_571) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| v_ArrVal_578) |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_56| |c_#StackHeapBarrier|))))))) is different from false [2022-11-16 19:47:53,781 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-11-16 19:47:53,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151476191] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 19:47:53,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [513312975] [2022-11-16 19:47:53,784 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-16 19:47:53,784 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 19:47:53,784 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-16 19:47:53,785 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-16 19:47:53,785 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-16 19:47:53,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:53,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:53,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-16 19:47:53,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:53,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:53,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-16 19:47:53,867 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 62 for LOIs [2022-11-16 19:47:54,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:47:54,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-16 19:47:54,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:47:54,463 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 19:47:54,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2022-11-16 19:47:54,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-11-16 19:47:54,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:47:54,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:47:54,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-16 19:47:54,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:54,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-16 19:47:54,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 19:47:54,690 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 1 [2022-11-16 19:47:54,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:54,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-16 19:47:54,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:54,872 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 19:47:54,872 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 30 [2022-11-16 19:47:54,918 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 1 [2022-11-16 19:47:55,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:55,038 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-16 19:47:55,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 33 [2022-11-16 19:47:55,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:47:55,095 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-16 19:47:55,117 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 1 [2022-11-16 19:47:55,390 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-16 19:48:00,363 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4769#(and (= |sll_append_node_create_with_sublist_#res#1.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (= |sll_append_node_create_with_sublist_#res#1.base| |sll_append_~new_last~0#1.base|) (<= 0 |sll_append_~head#1.offset|) (not (= 0 |sll_append_sll_create_~new_head~0#1.base|)) (<= |sll_append_~sublist_length#1| 3) (<= 0 |sll_append_#in~head#1.base|) (= (select |#valid| |sll_append_~head#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |sll_append_~head#1.base|) |sll_append_~head#1.offset|) |sll_append_~temp~0#1.offset|) (<= |sll_append_#in~sublist_length#1| 3) (<= |sll_append_node_create_with_sublist_~new_node~0#1.offset| 0) (<= |sll_append_#in~head#1.offset| 0) (<= |sll_append_node_create_with_sublist_~sublist_length#1| 3) (<= (+ |sll_append_sll_create_~new_head~0#1.offset| 4) (select |#length| |sll_append_sll_create_~new_head~0#1.base|)) (<= 0 |sll_append_~head#1.base|) (= |sll_append_sll_create_#res#1.offset| (select (select |#memory_$Pointer$.offset| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= 0 |sll_append_sll_create_~new_head~0#1.offset|) (<= |sll_append_sll_create_~len#1| 0) (= |sll_append_sll_create_#res#1.offset| |sll_append_sll_create_~head~0#1.offset|) (<= (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 8) (select |#length| |sll_append_node_create_with_sublist_~new_node~0#1.base|)) (= |sll_append_node_create_with_sublist_#res#1.offset| |sll_append_~new_last~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |sll_append_sll_create_~new_head~0#1.offset|) 0) (= (select |#valid| |sll_append_sll_create_~new_head~0#1.base|) 1) (<= (+ |sll_append_~head#1.offset| 4) (select |#length| |sll_append_~head#1.base|)) (<= |#NULL.offset| 0) (= |sll_append_sll_create_#res#1.base| |sll_append_sll_create_~head~0#1.base|) (or (not (= |sll_append_~temp~0#1.base| 0)) (not (= |sll_append_~temp~0#1.offset| 0))) (<= 3 |sll_append_node_create_with_sublist_~sublist_length#1|) (<= 0 |sll_append_~new_last~0#1.offset|) (<= 0 |sll_append_sll_create_~head~0#1.offset|) (<= |sll_append_sll_create_~head~0#1.offset| 0) (<= 3 |sll_append_~sublist_length#1|) (= (select (select |#memory_$Pointer$.base| |sll_append_~head#1.base|) |sll_append_~head#1.offset|) |sll_append_~temp~0#1.base|) (<= |sll_append_node_create_with_sublist_#in~sublist_length#1| 3) (<= |sll_append_sll_create_#in~len#1| 3) (<= |sll_append_sll_create_~new_head~0#1.offset| 0) (<= 3 |sll_append_#in~sublist_length#1|) (<= 0 |sll_append_#in~head#1.offset|) (= |sll_append_node_create_with_sublist_#res#1.offset| |sll_append_node_create_with_sublist_~new_node~0#1.offset|) (= |sll_append_sll_create_~head~0#1.base| |sll_append_sll_create_~new_head~0#1.base|) (= (select |#valid| |sll_append_node_create_with_sublist_~new_node~0#1.base|) 1) (<= |sll_append_~head#1.offset| 0) (= |sll_append_sll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= 0 |#NULL.offset|) (<= 3 |sll_append_sll_create_#in~len#1|) (not (= (select |#valid| |sll_append_~temp~0#1.base|) 1)) (= (select (select |#memory_$Pointer$.offset| |sll_append_node_create_with_sublist_~new_node~0#1.base|) |sll_append_node_create_with_sublist_~new_node~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) |sll_append_node_create_with_sublist_~new_node~0#1.offset|) 0) (<= 0 |#StackHeapBarrier|) (<= 3 |sll_append_node_create_with_sublist_#in~sublist_length#1|) (= |#NULL.base| 0))' at error location [2022-11-16 19:48:00,363 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-16 19:48:00,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 19:48:00,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 13] total 32 [2022-11-16 19:48:00,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994149837] [2022-11-16 19:48:00,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 19:48:00,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-16 19:48:00,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:48:00,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-16 19:48:00,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1329, Unknown=41, NotChecked=574, Total=2162 [2022-11-16 19:48:00,366 INFO L87 Difference]: Start difference. First operand 161 states and 203 transitions. Second operand has 33 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 29 states have internal predecessors, (61), 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-11-16 19:48:11,764 WARN L233 SmtUtils]: Spent 8.56s on a formula simplification. DAG size of input: 93 DAG size of output: 58 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 19:48:17,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:48:17,150 INFO L93 Difference]: Finished difference Result 178 states and 216 transitions. [2022-11-16 19:48:17,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 19:48:17,151 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 29 states have internal predecessors, (61), 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 24 [2022-11-16 19:48:17,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:48:17,152 INFO L225 Difference]: With dead ends: 178 [2022-11-16 19:48:17,152 INFO L226 Difference]: Without dead ends: 178 [2022-11-16 19:48:17,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 39 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 34.3s TimeCoverageRelationStatistics Valid=303, Invalid=1753, Unknown=42, NotChecked=658, Total=2756 [2022-11-16 19:48:17,154 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 24 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 503 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 19:48:17,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1162 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 243 Invalid, 0 Unknown, 503 Unchecked, 0.3s Time] [2022-11-16 19:48:17,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-16 19:48:17,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 172. [2022-11-16 19:48:17,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 133 states have (on average 1.443609022556391) internal successors, (192), 163 states have internal predecessors, (192), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-16 19:48:17,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 209 transitions. [2022-11-16 19:48:17,161 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 209 transitions. Word has length 24 [2022-11-16 19:48:17,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:48:17,161 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 209 transitions. [2022-11-16 19:48:17,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 29 states have internal predecessors, (61), 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-11-16 19:48:17,161 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 209 transitions. [2022-11-16 19:48:17,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-16 19:48:17,162 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:48:17,162 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:48:17,175 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 19:48:17,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:48:17,363 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting sll_appendErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-16 19:48:17,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:48:17,363 INFO L85 PathProgramCache]: Analyzing trace with hash 397888227, now seen corresponding path program 1 times [2022-11-16 19:48:17,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:48:17,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123252544] [2022-11-16 19:48:17,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:48:17,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:48:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:48:17,538 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 19:48:17,538 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:48:17,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123252544] [2022-11-16 19:48:17,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123252544] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 19:48:17,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234306129] [2022-11-16 19:48:17,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:48:17,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:48:17,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:48:17,543 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 19:48:17,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 19:48:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:48:17,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 19:48:17,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:48:17,722 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 19:48:17,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 19:48:17,822 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 19:48:17,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234306129] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 19:48:17,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1220659143] [2022-11-16 19:48:17,824 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-16 19:48:17,824 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 19:48:17,824 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-16 19:48:17,825 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-16 19:48:17,825 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-16 19:48:17,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:48:17,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:48:17,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-16 19:48:18,022 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 30 for LOIs [2022-11-16 19:48:18,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-16 19:48:18,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:48:18,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:48:18,480 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 19:48:18,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-16 19:48:18,517 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 19:48:18,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2022-11-16 19:48:18,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:48:18,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-16 19:48:18,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:48:18,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 19:48:18,696 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 1 [2022-11-16 19:48:18,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:48:18,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-16 19:48:18,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:48:18,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-16 19:48:18,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:48:18,839 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 19:48:18,839 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 30 [2022-11-16 19:48:18,884 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 1 [2022-11-16 19:48:18,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:48:18,961 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-16 19:48:18,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 33 [2022-11-16 19:48:18,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:48:18,990 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-16 19:48:19,047 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 1 [2022-11-16 19:48:19,107 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-16 19:48:21,797 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5314#(and (= |sll_append_node_create_with_sublist_#res#1.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (= |sll_append_node_create_with_sublist_#res#1.base| |sll_append_~new_last~0#1.base|) (<= 0 |sll_append_~head#1.offset|) (not (= 0 |sll_append_sll_create_~new_head~0#1.base|)) (<= |sll_append_~sublist_length#1| 3) (<= 0 |sll_append_#in~head#1.base|) (<= |sll_append_#in~sublist_length#1| 3) (<= |sll_append_node_create_with_sublist_~new_node~0#1.offset| 0) (<= |sll_append_#in~head#1.offset| 0) (<= |sll_append_node_create_with_sublist_~sublist_length#1| 3) (<= (+ |sll_append_sll_create_~new_head~0#1.offset| 4) (select |#length| |sll_append_sll_create_~new_head~0#1.base|)) (<= 0 |sll_append_~head#1.base|) (= |sll_append_sll_create_#res#1.offset| (select (select |#memory_$Pointer$.offset| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= 0 |sll_append_sll_create_~new_head~0#1.offset|) (<= |sll_append_sll_create_~len#1| 0) (= |sll_append_sll_create_#res#1.offset| |sll_append_sll_create_~head~0#1.offset|) (<= (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 8) (select |#length| |sll_append_node_create_with_sublist_~new_node~0#1.base|)) (= |sll_append_node_create_with_sublist_#res#1.offset| |sll_append_~new_last~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |sll_append_sll_create_~new_head~0#1.offset|) 0) (= (select |#valid| |sll_append_sll_create_~new_head~0#1.base|) 1) (<= |#NULL.offset| 0) (not (= (select |#valid| |sll_append_~head#1.base|) 1)) (= |sll_append_sll_create_#res#1.base| |sll_append_sll_create_~head~0#1.base|) (<= 3 |sll_append_node_create_with_sublist_~sublist_length#1|) (<= 0 |sll_append_~new_last~0#1.offset|) (<= 0 |sll_append_sll_create_~head~0#1.offset|) (<= |sll_append_sll_create_~head~0#1.offset| 0) (<= 3 |sll_append_~sublist_length#1|) (<= |sll_append_node_create_with_sublist_#in~sublist_length#1| 3) (<= |sll_append_sll_create_#in~len#1| 3) (<= |sll_append_sll_create_~new_head~0#1.offset| 0) (<= 3 |sll_append_#in~sublist_length#1|) (<= 0 |sll_append_#in~head#1.offset|) (= |sll_append_node_create_with_sublist_#res#1.offset| |sll_append_node_create_with_sublist_~new_node~0#1.offset|) (= |sll_append_sll_create_~head~0#1.base| |sll_append_sll_create_~new_head~0#1.base|) (= (select |#valid| |sll_append_node_create_with_sublist_~new_node~0#1.base|) 1) (<= |sll_append_~head#1.offset| 0) (= |sll_append_sll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= 0 |#NULL.offset|) (<= 3 |sll_append_sll_create_#in~len#1|) (= (select (select |#memory_$Pointer$.offset| |sll_append_node_create_with_sublist_~new_node~0#1.base|) |sll_append_node_create_with_sublist_~new_node~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) |sll_append_node_create_with_sublist_~new_node~0#1.offset|) 0) (<= 0 |#StackHeapBarrier|) (<= 3 |sll_append_node_create_with_sublist_#in~sublist_length#1|) (= |#NULL.base| 0))' at error location [2022-11-16 19:48:21,798 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-16 19:48:21,798 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 19:48:21,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2022-11-16 19:48:21,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62201937] [2022-11-16 19:48:21,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 19:48:21,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 19:48:21,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:48:21,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 19:48:21,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2022-11-16 19:48:21,800 INFO L87 Difference]: Start difference. First operand 172 states and 209 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 9 states have internal predecessors, (35), 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-11-16 19:48:22,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:48:22,070 INFO L93 Difference]: Finished difference Result 237 states and 276 transitions. [2022-11-16 19:48:22,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 19:48:22,070 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 9 states have internal predecessors, (35), 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 26 [2022-11-16 19:48:22,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:48:22,072 INFO L225 Difference]: With dead ends: 237 [2022-11-16 19:48:22,072 INFO L226 Difference]: Without dead ends: 237 [2022-11-16 19:48:22,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2022-11-16 19:48:22,073 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 253 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 19:48:22,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 368 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 19:48:22,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-11-16 19:48:22,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 230. [2022-11-16 19:48:22,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 189 states have (on average 1.3703703703703705) internal successors, (259), 219 states have internal predecessors, (259), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-16 19:48:22,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 276 transitions. [2022-11-16 19:48:22,081 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 276 transitions. Word has length 26 [2022-11-16 19:48:22,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:48:22,081 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 276 transitions. [2022-11-16 19:48:22,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 9 states have internal predecessors, (35), 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-11-16 19:48:22,082 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 276 transitions. [2022-11-16 19:48:22,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-16 19:48:22,082 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:48:22,082 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:48:22,090 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 19:48:22,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-16 19:48:22,288 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-11-16 19:48:22,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:48:22,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1906821693, now seen corresponding path program 2 times [2022-11-16 19:48:22,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:48:22,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202712568] [2022-11-16 19:48:22,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:48:22,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:48:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:48:22,693 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-16 19:48:22,693 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:48:22,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202712568] [2022-11-16 19:48:22,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202712568] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 19:48:22,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215662190] [2022-11-16 19:48:22,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 19:48:22,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:48:22,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:48:22,699 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 19:48:22,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 19:48:22,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-16 19:48:22,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 19:48:22,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-16 19:48:22,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:48:22,886 INFO L350 Elim1Store]: Elim1 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-11-16 19:48:22,976 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 19:48:22,976 INFO L350 Elim1Store]: Elim1 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-11-16 19:48:23,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:48:23,018 INFO L350 Elim1Store]: Elim1 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-11-16 19:48:23,047 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 19:48:23,047 INFO L350 Elim1Store]: Elim1 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-11-16 19:48:23,130 INFO L321 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-11-16 19:48:23,130 INFO L350 Elim1Store]: Elim1 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-11-16 19:48:23,259 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-16 19:48:23,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 19:48:23,774 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-16 19:48:23,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215662190] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 19:48:23,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1951226065] [2022-11-16 19:48:23,778 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-16 19:48:23,779 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 19:48:23,779 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-16 19:48:23,779 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-16 19:48:23,780 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-16 19:48:23,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:48:23,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:48:23,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-16 19:48:23,995 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 30 for LOIs [2022-11-16 19:48:24,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:48:24,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-16 19:48:24,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:48:24,441 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 19:48:24,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2022-11-16 19:48:24,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-11-16 19:48:24,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:48:24,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-16 19:48:24,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:48:24,603 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 1 [2022-11-16 19:48:24,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:48:24,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-16 19:48:24,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 19:48:24,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:48:24,762 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 19:48:24,762 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 30 [2022-11-16 19:48:24,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:48:24,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-16 19:48:24,812 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 1 [2022-11-16 19:48:24,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:48:24,895 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-16 19:48:24,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 33 [2022-11-16 19:48:24,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:48:24,936 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-16 19:48:24,973 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 1 [2022-11-16 19:48:25,035 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-16 19:48:27,970 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6006#(and (= |sll_append_node_create_with_sublist_#res#1.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (= |sll_append_node_create_with_sublist_#res#1.base| |sll_append_~new_last~0#1.base|) (<= 0 |sll_append_~head#1.offset|) (not (= 0 |sll_append_sll_create_~new_head~0#1.base|)) (<= |sll_append_~sublist_length#1| 3) (<= 0 |sll_append_#in~head#1.base|) (= 3 |sll_append_#in~sublist_length#1|) (<= |sll_append_node_create_with_sublist_~sublist_length#1| 3) (<= (+ |sll_append_sll_create_~new_head~0#1.offset| 4) (select |#length| |sll_append_sll_create_~new_head~0#1.base|)) (<= 0 |sll_append_~head#1.base|) (= |sll_append_sll_create_#res#1.offset| (select (select |#memory_$Pointer$.offset| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= |sll_append_sll_create_~len#1| 0) (= |sll_append_sll_create_#res#1.offset| |sll_append_sll_create_~head~0#1.offset|) (= |sll_append_#in~head#1.offset| 0) (<= (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 8) (select |#length| |sll_append_node_create_with_sublist_~new_node~0#1.base|)) (= |sll_append_node_create_with_sublist_#res#1.offset| |sll_append_~new_last~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |sll_append_sll_create_~new_head~0#1.offset|) 0) (= (select |#valid| |sll_append_sll_create_~new_head~0#1.base|) 1) (not (= (select |#valid| |sll_append_~head#1.base|) 1)) (= |sll_append_sll_create_#res#1.base| |sll_append_sll_create_~head~0#1.base|) (<= 3 |sll_append_node_create_with_sublist_~sublist_length#1|) (<= 3 |sll_append_~sublist_length#1|) (<= |sll_append_node_create_with_sublist_#in~sublist_length#1| 3) (<= |sll_append_sll_create_#in~len#1| 3) (= |sll_append_sll_create_~new_head~0#1.offset| |sll_append_sll_create_~head~0#1.offset|) (= |#NULL.offset| 0) (= |sll_append_node_create_with_sublist_#res#1.offset| |sll_append_node_create_with_sublist_~new_node~0#1.offset|) (= |sll_append_sll_create_~head~0#1.base| |sll_append_sll_create_~new_head~0#1.base|) (= (select |#valid| |sll_append_node_create_with_sublist_~new_node~0#1.base|) 1) (<= |sll_append_~head#1.offset| 0) (= |sll_append_sll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= 3 |sll_append_sll_create_#in~len#1|) (= |sll_append_sll_create_~new_head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |sll_append_node_create_with_sublist_~new_node~0#1.base|) |sll_append_node_create_with_sublist_~new_node~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) |sll_append_node_create_with_sublist_~new_node~0#1.offset|) 0) (<= 0 |#StackHeapBarrier|) (= |sll_append_node_create_with_sublist_~new_node~0#1.offset| 0) (<= 3 |sll_append_node_create_with_sublist_#in~sublist_length#1|) (= |#NULL.base| 0))' at error location [2022-11-16 19:48:27,970 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-16 19:48:27,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 19:48:27,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 16 [2022-11-16 19:48:27,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095425552] [2022-11-16 19:48:27,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 19:48:27,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 19:48:27,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:48:27,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 19:48:27,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=809, Unknown=0, NotChecked=0, Total=930 [2022-11-16 19:48:27,973 INFO L87 Difference]: Start difference. First operand 230 states and 276 transitions. Second operand has 18 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 15 states have internal predecessors, (53), 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-11-16 19:48:28,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:48:28,372 INFO L93 Difference]: Finished difference Result 233 states and 277 transitions. [2022-11-16 19:48:28,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 19:48:28,373 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 15 states have internal predecessors, (53), 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-11-16 19:48:28,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:48:28,375 INFO L225 Difference]: With dead ends: 233 [2022-11-16 19:48:28,375 INFO L226 Difference]: Without dead ends: 233 [2022-11-16 19:48:28,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 70 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=167, Invalid=955, Unknown=0, NotChecked=0, Total=1122 [2022-11-16 19:48:28,376 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 143 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 19:48:28,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 340 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 269 Invalid, 0 Unknown, 126 Unchecked, 0.2s Time] [2022-11-16 19:48:28,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-11-16 19:48:28,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2022-11-16 19:48:28,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 190 states have (on average 1.3631578947368421) internal successors, (259), 220 states have internal predecessors, (259), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-16 19:48:28,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 275 transitions. [2022-11-16 19:48:28,395 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 275 transitions. Word has length 32 [2022-11-16 19:48:28,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:48:28,396 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 275 transitions. [2022-11-16 19:48:28,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 15 states have internal predecessors, (53), 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-11-16 19:48:28,396 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 275 transitions. [2022-11-16 19:48:28,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-16 19:48:28,397 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:48:28,397 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 19:48:28,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 19:48:28,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-16 19:48:28,607 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-16 19:48:28,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:48:28,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1707604520, now seen corresponding path program 1 times [2022-11-16 19:48:28,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:48:28,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130964214] [2022-11-16 19:48:28,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:48:28,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:48:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:48:28,790 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-16 19:48:28,790 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:48:28,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130964214] [2022-11-16 19:48:28,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130964214] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 19:48:28,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322067120] [2022-11-16 19:48:28,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:48:28,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:48:28,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:48:28,793 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 19:48:28,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 19:48:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:48:28,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 19:48:28,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:48:29,082 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-16 19:48:29,082 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 19:48:29,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322067120] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:48:29,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 19:48:29,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-11-16 19:48:29,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224186964] [2022-11-16 19:48:29,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:48:29,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 19:48:29,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:48:29,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 19:48:29,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-16 19:48:29,085 INFO L87 Difference]: Start difference. First operand 231 states and 275 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-11-16 19:48:29,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:48:29,232 INFO L93 Difference]: Finished difference Result 277 states and 327 transitions. [2022-11-16 19:48:29,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 19:48:29,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 40 [2022-11-16 19:48:29,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:48:29,235 INFO L225 Difference]: With dead ends: 277 [2022-11-16 19:48:29,235 INFO L226 Difference]: Without dead ends: 277 [2022-11-16 19:48:29,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-16 19:48:29,236 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 160 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:48:29,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 137 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:48:29,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-11-16 19:48:29,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 231. [2022-11-16 19:48:29,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 190 states have (on average 1.3631578947368421) internal successors, (259), 220 states have internal predecessors, (259), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-16 19:48:29,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 275 transitions. [2022-11-16 19:48:29,250 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 275 transitions. Word has length 40 [2022-11-16 19:48:29,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:48:29,252 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 275 transitions. [2022-11-16 19:48:29,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-11-16 19:48:29,253 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 275 transitions. [2022-11-16 19:48:29,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-16 19:48:29,254 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:48:29,254 INFO L195 NwaCegarLoop]: trace histogram [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-11-16 19:48:29,269 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 19:48:29,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-16 19:48:29,470 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-16 19:48:29,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:48:29,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1391473257, now seen corresponding path program 1 times [2022-11-16 19:48:29,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:48:29,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149763933] [2022-11-16 19:48:29,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:48:29,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:48:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:48:29,717 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-16 19:48:29,717 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:48:29,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149763933] [2022-11-16 19:48:29,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149763933] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:48:29,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:48:29,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 19:48:29,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427928872] [2022-11-16 19:48:29,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:48:29,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 19:48:29,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:48:29,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 19:48:29,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 19:48:29,718 INFO L87 Difference]: Start difference. First operand 231 states and 275 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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-11-16 19:48:30,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:48:30,078 INFO L93 Difference]: Finished difference Result 343 states and 413 transitions. [2022-11-16 19:48:30,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 19:48:30,078 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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 41 [2022-11-16 19:48:30,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:48:30,080 INFO L225 Difference]: With dead ends: 343 [2022-11-16 19:48:30,081 INFO L226 Difference]: Without dead ends: 343 [2022-11-16 19:48:30,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-11-16 19:48:30,081 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 144 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 19:48:30,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 342 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 19:48:30,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-11-16 19:48:30,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 247. [2022-11-16 19:48:30,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 205 states have (on average 1.3804878048780487) internal successors, (283), 235 states have internal predecessors, (283), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 5 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-16 19:48:30,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 300 transitions. [2022-11-16 19:48:30,096 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 300 transitions. Word has length 41 [2022-11-16 19:48:30,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:48:30,096 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 300 transitions. [2022-11-16 19:48:30,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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-11-16 19:48:30,097 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 300 transitions. [2022-11-16 19:48:30,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-16 19:48:30,099 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:48:30,099 INFO L195 NwaCegarLoop]: trace histogram [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-11-16 19:48:30,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 19:48:30,100 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-16 19:48:30,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:48:30,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1396133748, now seen corresponding path program 1 times [2022-11-16 19:48:30,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:48:30,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393245750] [2022-11-16 19:48:30,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:48:30,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:48:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:48:30,372 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-16 19:48:30,372 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:48:30,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393245750] [2022-11-16 19:48:30,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393245750] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:48:30,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:48:30,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 19:48:30,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126164442] [2022-11-16 19:48:30,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:48:30,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 19:48:30,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:48:30,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 19:48:30,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 19:48:30,374 INFO L87 Difference]: Start difference. First operand 247 states and 300 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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-11-16 19:48:30,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:48:30,998 INFO L93 Difference]: Finished difference Result 398 states and 481 transitions. [2022-11-16 19:48:30,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 19:48:30,998 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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 41 [2022-11-16 19:48:30,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:48:31,000 INFO L225 Difference]: With dead ends: 398 [2022-11-16 19:48:31,001 INFO L226 Difference]: Without dead ends: 398 [2022-11-16 19:48:31,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-11-16 19:48:31,001 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 191 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 19:48:31,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 370 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 19:48:31,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-11-16 19:48:31,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 253. [2022-11-16 19:48:31,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 212 states have (on average 1.3820754716981132) internal successors, (293), 241 states have internal predecessors, (293), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 5 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-16 19:48:31,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 310 transitions. [2022-11-16 19:48:31,016 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 310 transitions. Word has length 41 [2022-11-16 19:48:31,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:48:31,016 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 310 transitions. [2022-11-16 19:48:31,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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-11-16 19:48:31,017 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 310 transitions. [2022-11-16 19:48:31,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-16 19:48:31,017 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:48:31,018 INFO L195 NwaCegarLoop]: trace histogram [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-11-16 19:48:31,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 19:48:31,018 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-16 19:48:31,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:48:31,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1396133747, now seen corresponding path program 1 times [2022-11-16 19:48:31,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:48:31,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618355975] [2022-11-16 19:48:31,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:48:31,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:48:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:48:31,517 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-16 19:48:31,517 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:48:31,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618355975] [2022-11-16 19:48:31,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618355975] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:48:31,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:48:31,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 19:48:31,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530087743] [2022-11-16 19:48:31,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:48:31,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 19:48:31,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:48:31,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 19:48:31,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 19:48:31,519 INFO L87 Difference]: Start difference. First operand 253 states and 310 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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-11-16 19:48:31,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:48:31,960 INFO L93 Difference]: Finished difference Result 349 states and 428 transitions. [2022-11-16 19:48:31,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 19:48:31,962 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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 41 [2022-11-16 19:48:31,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:48:31,963 INFO L225 Difference]: With dead ends: 349 [2022-11-16 19:48:31,963 INFO L226 Difference]: Without dead ends: 349 [2022-11-16 19:48:31,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-11-16 19:48:31,964 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 156 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 19:48:31,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 294 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 19:48:31,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-11-16 19:48:31,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 254. [2022-11-16 19:48:31,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 213 states have (on average 1.375586854460094) internal successors, (293), 242 states have internal predecessors, (293), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 5 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-16 19:48:31,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 310 transitions. [2022-11-16 19:48:31,979 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 310 transitions. Word has length 41 [2022-11-16 19:48:31,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:48:31,979 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 310 transitions. [2022-11-16 19:48:31,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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-11-16 19:48:31,980 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 310 transitions. [2022-11-16 19:48:31,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-16 19:48:31,980 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:48:31,980 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 19:48:31,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-16 19:48:31,981 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-16 19:48:31,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:48:31,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1654615867, now seen corresponding path program 1 times [2022-11-16 19:48:31,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:48:31,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434995254] [2022-11-16 19:48:31,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:48:31,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:48:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:48:32,945 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-16 19:48:32,945 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:48:32,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434995254] [2022-11-16 19:48:32,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434995254] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:48:32,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:48:32,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 19:48:32,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181055269] [2022-11-16 19:48:32,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:48:32,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 19:48:32,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:48:32,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 19:48:32,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-11-16 19:48:32,947 INFO L87 Difference]: Start difference. First operand 254 states and 310 transitions. Second operand has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 11 states have internal predecessors, (28), 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-11-16 19:48:33,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:48:33,940 INFO L93 Difference]: Finished difference Result 437 states and 533 transitions. [2022-11-16 19:48:33,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 19:48:33,941 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 11 states have internal predecessors, (28), 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 43 [2022-11-16 19:48:33,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:48:33,943 INFO L225 Difference]: With dead ends: 437 [2022-11-16 19:48:33,943 INFO L226 Difference]: Without dead ends: 437 [2022-11-16 19:48:33,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2022-11-16 19:48:33,944 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 437 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 19:48:33,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 477 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 19:48:33,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-11-16 19:48:33,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 270. [2022-11-16 19:48:33,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 229 states have (on average 1.388646288209607) internal successors, (318), 257 states have internal predecessors, (318), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 6 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-16 19:48:33,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 335 transitions. [2022-11-16 19:48:33,955 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 335 transitions. Word has length 43 [2022-11-16 19:48:33,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:48:33,955 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 335 transitions. [2022-11-16 19:48:33,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 11 states have internal predecessors, (28), 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-11-16 19:48:33,956 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 335 transitions. [2022-11-16 19:48:33,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-16 19:48:33,956 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:48:33,956 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 19:48:33,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-16 19:48:33,957 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-16 19:48:33,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:48:33,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1654615866, now seen corresponding path program 1 times [2022-11-16 19:48:33,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:48:33,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067701157] [2022-11-16 19:48:33,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:48:33,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:48:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:48:35,402 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-16 19:48:35,402 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:48:35,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067701157] [2022-11-16 19:48:35,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067701157] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:48:35,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:48:35,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-16 19:48:35,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040452356] [2022-11-16 19:48:35,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:48:35,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 19:48:35,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:48:35,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 19:48:35,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-11-16 19:48:35,404 INFO L87 Difference]: Start difference. First operand 270 states and 335 transitions. Second operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 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-11-16 19:48:36,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:48:36,701 INFO L93 Difference]: Finished difference Result 484 states and 583 transitions. [2022-11-16 19:48:36,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 19:48:36,704 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 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 43 [2022-11-16 19:48:36,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:48:36,706 INFO L225 Difference]: With dead ends: 484 [2022-11-16 19:48:36,706 INFO L226 Difference]: Without dead ends: 484 [2022-11-16 19:48:36,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=117, Invalid=639, Unknown=0, NotChecked=0, Total=756 [2022-11-16 19:48:36,707 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 520 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 19:48:36,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 415 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-16 19:48:36,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2022-11-16 19:48:36,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 270. [2022-11-16 19:48:36,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 229 states have (on average 1.3842794759825328) internal successors, (317), 257 states have internal predecessors, (317), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 6 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-16 19:48:36,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 334 transitions. [2022-11-16 19:48:36,724 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 334 transitions. Word has length 43 [2022-11-16 19:48:36,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:48:36,724 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 334 transitions. [2022-11-16 19:48:36,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 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-11-16 19:48:36,725 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 334 transitions. [2022-11-16 19:48:36,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-16 19:48:36,725 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:48:36,725 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 19:48:36,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-16 19:48:36,726 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-16 19:48:36,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:48:36,726 INFO L85 PathProgramCache]: Analyzing trace with hash -947831941, now seen corresponding path program 1 times [2022-11-16 19:48:36,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:48:36,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536050935] [2022-11-16 19:48:36,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:48:36,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:48:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:48:38,932 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-16 19:48:38,932 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:48:38,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536050935] [2022-11-16 19:48:38,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536050935] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 19:48:38,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696048714] [2022-11-16 19:48:38,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:48:38,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:48:38,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:48:38,934 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 19:48:38,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42c9a743-b190-4f23-a533-ca2f675f9cc0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 19:48:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:48:39,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 123 conjunts are in the unsatisfiable core [2022-11-16 19:48:39,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:48:39,158 INFO L350 Elim1Store]: Elim1 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-11-16 19:48:39,352 INFO L350 Elim1Store]: Elim1 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-11-16 19:48:39,527 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 19:48:39,528 INFO L350 Elim1Store]: Elim1 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-11-16 19:48:39,646 INFO L350 Elim1Store]: Elim1 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-11-16 19:48:39,661 INFO L350 Elim1Store]: Elim1 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-11-16 19:48:39,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:48:39,851 INFO L350 Elim1Store]: Elim1 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-11-16 19:48:39,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:48:39,859 INFO L350 Elim1Store]: Elim1 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-11-16 19:48:39,994 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-16 19:48:39,994 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 40 [2022-11-16 19:48:40,022 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-16 19:48:40,022 INFO L350 Elim1Store]: Elim1 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 72 treesize of output 53 [2022-11-16 19:48:40,208 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-16 19:48:40,208 INFO L350 Elim1Store]: Elim1 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 38 treesize of output 48 [2022-11-16 19:48:40,232 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-16 19:48:40,232 INFO L350 Elim1Store]: Elim1 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 110 treesize of output 79 [2022-11-16 19:48:40,948 INFO L321 Elim1Store]: treesize reduction 68, result has 50.7 percent of original size [2022-11-16 19:48:40,949 INFO L350 Elim1Store]: Elim1 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-11-16 19:48:41,007 INFO L321 Elim1Store]: treesize reduction 108, result has 21.7 percent of original size [2022-11-16 19:48:41,007 INFO L350 Elim1Store]: Elim1 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 41 treesize of output 46 [2022-11-16 19:48:41,639 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 19:48:41,640 INFO L350 Elim1Store]: Elim1 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-11-16 19:48:43,213 INFO L321 Elim1Store]: treesize reduction 308, result has 32.6 percent of original size [2022-11-16 19:48:43,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 2 disjoint index pairs (out of 45 index pairs), introduced 13 new quantified variables, introduced 45 case distinctions, treesize of input 291 treesize of output 288 [2022-11-16 19:48:43,726 INFO L321 Elim1Store]: treesize reduction 168, result has 54.0 percent of original size [2022-11-16 19:48:43,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 2 disjoint index pairs (out of 45 index pairs), introduced 12 new quantified variables, introduced 44 case distinctions, treesize of input 187 treesize of output 325