./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 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/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_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur --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-38b53e6 [2022-11-26 01:07:12,832 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 01:07:12,834 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 01:07:12,863 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 01:07:12,864 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 01:07:12,868 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 01:07:12,871 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 01:07:12,874 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 01:07:12,876 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 01:07:12,882 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 01:07:12,884 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 01:07:12,886 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 01:07:12,887 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 01:07:12,890 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 01:07:12,893 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 01:07:12,895 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 01:07:12,897 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 01:07:12,898 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 01:07:12,900 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 01:07:12,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 01:07:12,909 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 01:07:12,911 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 01:07:12,913 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 01:07:12,914 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 01:07:12,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 01:07:12,927 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 01:07:12,928 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 01:07:12,930 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 01:07:12,930 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 01:07:12,931 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 01:07:12,932 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 01:07:12,933 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 01:07:12,935 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 01:07:12,937 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 01:07:12,940 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 01:07:12,941 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 01:07:12,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 01:07:12,942 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 01:07:12,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 01:07:12,945 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 01:07:12,946 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 01:07:12,947 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2022-11-26 01:07:12,998 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 01:07:12,998 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 01:07:13,000 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 01:07:13,001 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 01:07:13,002 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 01:07:13,002 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 01:07:13,002 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 01:07:13,003 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 01:07:13,003 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 01:07:13,003 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 01:07:13,005 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 01:07:13,005 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 01:07:13,006 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 01:07:13,006 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 01:07:13,006 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 01:07:13,007 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 01:07:13,007 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 01:07:13,007 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 01:07:13,008 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-26 01:07:13,008 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-26 01:07:13,009 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 01:07:13,009 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 01:07:13,009 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-26 01:07:13,010 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 01:07:13,010 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 01:07:13,010 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 01:07:13,011 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-26 01:07:13,011 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-26 01:07:13,011 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 01:07:13,012 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-26 01:07:13,012 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 01:07:13,012 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 01:07:13,013 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 01:07:13,013 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 01:07:13,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 01:07:13,014 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 01:07:13,014 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 01:07:13,014 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 01:07:13,015 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 01:07:13,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 01:07:13,015 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 01:07:13,016 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_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/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_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur 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-26 01:07:13,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 01:07:13,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 01:07:13,354 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 01:07:13,356 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 01:07:13,356 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 01:07:13,358 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i [2022-11-26 01:07:16,539 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 01:07:16,956 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 01:07:16,957 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i [2022-11-26 01:07:16,974 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/data/e5e89d37d/1069b19bc9ea4ec4bfb8d80421b0f004/FLAG2d58032c8 [2022-11-26 01:07:16,990 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/data/e5e89d37d/1069b19bc9ea4ec4bfb8d80421b0f004 [2022-11-26 01:07:16,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 01:07:16,995 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 01:07:16,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 01:07:16,997 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 01:07:17,002 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 01:07:17,003 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:07:16" (1/1) ... [2022-11-26 01:07:17,004 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4918028f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:17, skipping insertion in model container [2022-11-26 01:07:17,005 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:07:16" (1/1) ... [2022-11-26 01:07:17,014 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 01:07:17,058 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 01:07:17,453 WARN L237 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_c7b0694c-2924-4a92-88be-79983945f2d6/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i[25013,25026] [2022-11-26 01:07:17,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 01:07:17,472 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 01:07:17,544 WARN L237 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_c7b0694c-2924-4a92-88be-79983945f2d6/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i[25013,25026] [2022-11-26 01:07:17,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 01:07:17,572 INFO L208 MainTranslator]: Completed translation [2022-11-26 01:07:17,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:17 WrapperNode [2022-11-26 01:07:17,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 01:07:17,574 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 01:07:17,574 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 01:07:17,574 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 01:07:17,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:17" (1/1) ... [2022-11-26 01:07:17,608 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:17" (1/1) ... [2022-11-26 01:07:17,641 INFO L138 Inliner]: procedures = 129, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 186 [2022-11-26 01:07:17,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 01:07:17,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 01:07:17,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 01:07:17,643 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 01:07:17,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:17" (1/1) ... [2022-11-26 01:07:17,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:17" (1/1) ... [2022-11-26 01:07:17,668 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:17" (1/1) ... [2022-11-26 01:07:17,672 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:17" (1/1) ... [2022-11-26 01:07:17,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:17" (1/1) ... [2022-11-26 01:07:17,698 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:17" (1/1) ... [2022-11-26 01:07:17,700 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:17" (1/1) ... [2022-11-26 01:07:17,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:17" (1/1) ... [2022-11-26 01:07:17,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 01:07:17,715 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 01:07:17,715 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 01:07:17,716 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 01:07:17,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:17" (1/1) ... [2022-11-26 01:07:17,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 01:07:17,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:17,747 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 01:07:17,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 01:07:17,790 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-26 01:07:17,790 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-26 01:07:17,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-26 01:07:17,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 01:07:17,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-26 01:07:17,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-26 01:07:17,791 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2022-11-26 01:07:17,791 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2022-11-26 01:07:17,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-26 01:07:17,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 01:07:17,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-26 01:07:17,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 01:07:17,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 01:07:17,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 01:07:18,032 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 01:07:18,035 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 01:07:18,104 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-26 01:07:18,553 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 01:07:18,688 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 01:07:18,688 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-11-26 01:07:18,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:07:18 BoogieIcfgContainer [2022-11-26 01:07:18,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 01:07:18,695 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 01:07:18,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 01:07:18,699 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 01:07:18,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 01:07:16" (1/3) ... [2022-11-26 01:07:18,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495d226f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:07:18, skipping insertion in model container [2022-11-26 01:07:18,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:17" (2/3) ... [2022-11-26 01:07:18,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495d226f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:07:18, skipping insertion in model container [2022-11-26 01:07:18,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:07:18" (3/3) ... [2022-11-26 01:07:18,703 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-2.i [2022-11-26 01:07:18,726 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 01:07:18,726 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2022-11-26 01:07:18,782 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 01:07:18,790 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;@2b08e501, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 01:07:18,791 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2022-11-26 01:07:18,796 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-26 01:07:18,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-26 01:07:18,807 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:18,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:18,808 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-26 01:07:18,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:18,815 INFO L85 PathProgramCache]: Analyzing trace with hash -303362409, now seen corresponding path program 1 times [2022-11-26 01:07:18,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:18,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602479768] [2022-11-26 01:07:18,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:18,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:19,171 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-26 01:07:19,172 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:19,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602479768] [2022-11-26 01:07:19,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602479768] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:19,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:19,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 01:07:19,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84523981] [2022-11-26 01:07:19,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:19,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:07:19,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:19,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:07:19,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:19,215 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-26 01:07:19,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:19,321 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2022-11-26 01:07:19,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:07:19,324 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-26 01:07:19,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:19,333 INFO L225 Difference]: With dead ends: 105 [2022-11-26 01:07:19,333 INFO L226 Difference]: Without dead ends: 100 [2022-11-26 01:07:19,335 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-26 01:07:19,339 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-26 01:07:19,341 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-26 01:07:19,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-26 01:07:19,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2022-11-26 01:07:19,383 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-26 01:07:19,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2022-11-26 01:07:19,387 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 8 [2022-11-26 01:07:19,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:19,388 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2022-11-26 01:07:19,388 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-26 01:07:19,388 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2022-11-26 01:07:19,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-26 01:07:19,389 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:19,389 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:19,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 01:07:19,390 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-26 01:07:19,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:19,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1366900647, now seen corresponding path program 1 times [2022-11-26 01:07:19,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:19,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296670019] [2022-11-26 01:07:19,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:19,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:19,700 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-26 01:07:19,701 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:19,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296670019] [2022-11-26 01:07:19,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296670019] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:19,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:19,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-26 01:07:19,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303805136] [2022-11-26 01:07:19,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:19,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 01:07:19,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:19,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 01:07:19,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-26 01:07:19,706 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-26 01:07:19,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:19,985 INFO L93 Difference]: Finished difference Result 141 states and 158 transitions. [2022-11-26 01:07:19,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 01:07:19,988 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-26 01:07:19,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:19,989 INFO L225 Difference]: With dead ends: 141 [2022-11-26 01:07:19,990 INFO L226 Difference]: Without dead ends: 141 [2022-11-26 01:07:19,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-26 01:07:19,991 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 90 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-26 01:07:19,992 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-26 01:07:19,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-26 01:07:20,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 118. [2022-11-26 01:07:20,015 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-26 01:07:20,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 153 transitions. [2022-11-26 01:07:20,018 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 153 transitions. Word has length 10 [2022-11-26 01:07:20,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:20,019 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 153 transitions. [2022-11-26 01:07:20,019 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-26 01:07:20,019 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 153 transitions. [2022-11-26 01:07:20,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-26 01:07:20,020 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:20,020 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:20,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 01:07:20,021 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-26 01:07:20,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:20,021 INFO L85 PathProgramCache]: Analyzing trace with hash 575489218, now seen corresponding path program 1 times [2022-11-26 01:07:20,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:20,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859441870] [2022-11-26 01:07:20,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:20,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:20,238 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-26 01:07:20,238 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:20,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859441870] [2022-11-26 01:07:20,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859441870] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:20,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:20,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 01:07:20,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073736] [2022-11-26 01:07:20,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:20,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:07:20,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:20,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:07:20,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:20,242 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-26 01:07:20,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:20,455 INFO L93 Difference]: Finished difference Result 146 states and 184 transitions. [2022-11-26 01:07:20,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:07:20,456 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-26 01:07:20,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:20,465 INFO L225 Difference]: With dead ends: 146 [2022-11-26 01:07:20,465 INFO L226 Difference]: Without dead ends: 146 [2022-11-26 01:07:20,468 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-26 01:07:20,469 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 32 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:20,470 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.2s Time] [2022-11-26 01:07:20,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-26 01:07:20,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 117. [2022-11-26 01:07:20,492 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-26 01:07:20,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 151 transitions. [2022-11-26 01:07:20,497 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 151 transitions. Word has length 11 [2022-11-26 01:07:20,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:20,497 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 151 transitions. [2022-11-26 01:07:20,498 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-26 01:07:20,498 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 151 transitions. [2022-11-26 01:07:20,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-26 01:07:20,499 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:20,499 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:20,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 01:07:20,500 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-26 01:07:20,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:20,501 INFO L85 PathProgramCache]: Analyzing trace with hash 575489217, now seen corresponding path program 1 times [2022-11-26 01:07:20,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:20,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184069532] [2022-11-26 01:07:20,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:20,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:20,628 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-26 01:07:20,630 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:20,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184069532] [2022-11-26 01:07:20,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184069532] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:20,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:20,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 01:07:20,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186993794] [2022-11-26 01:07:20,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:20,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:07:20,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:20,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:07:20,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:20,635 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-26 01:07:20,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:20,801 INFO L93 Difference]: Finished difference Result 145 states and 182 transitions. [2022-11-26 01:07:20,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:07:20,802 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-26 01:07:20,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:20,804 INFO L225 Difference]: With dead ends: 145 [2022-11-26 01:07:20,804 INFO L226 Difference]: Without dead ends: 145 [2022-11-26 01:07:20,805 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-26 01:07:20,811 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.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:20,814 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.1s Time] [2022-11-26 01:07:20,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-26 01:07:20,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 116. [2022-11-26 01:07:20,834 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-26 01:07:20,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 149 transitions. [2022-11-26 01:07:20,841 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 149 transitions. Word has length 11 [2022-11-26 01:07:20,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:20,841 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 149 transitions. [2022-11-26 01:07:20,842 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-26 01:07:20,842 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 149 transitions. [2022-11-26 01:07:20,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-26 01:07:20,843 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:20,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:20,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-26 01:07:20,844 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-26 01:07:20,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:20,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1631077593, now seen corresponding path program 1 times [2022-11-26 01:07:20,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:20,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313538129] [2022-11-26 01:07:20,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:20,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:20,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:20,975 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-26 01:07:20,976 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:20,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313538129] [2022-11-26 01:07:20,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313538129] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:20,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769517069] [2022-11-26 01:07:20,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:20,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:20,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:20,981 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:21,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 01:07:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:21,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 01:07:21,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:21,203 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-26 01:07:21,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:07:21,239 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-26 01:07:21,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769517069] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:07:21,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [194404111] [2022-11-26 01:07:21,260 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2022-11-26 01:07:21,261 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:07:21,266 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:07:21,272 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:07:21,272 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:07:21,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:21,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:21,368 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-26 01:07:21,887 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 30 for LOIs [2022-11-26 01:07:21,925 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:07:22,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [194404111] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:22,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:07:22,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6, 3, 3] total 17 [2022-11-26 01:07:22,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876390013] [2022-11-26 01:07:22,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:22,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-26 01:07:22,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:22,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-26 01:07:22,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-11-26 01:07:22,423 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-26 01:07:22,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:22,963 INFO L93 Difference]: Finished difference Result 131 states and 167 transitions. [2022-11-26 01:07:22,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-26 01:07:22,965 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-26 01:07:22,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:22,966 INFO L225 Difference]: With dead ends: 131 [2022-11-26 01:07:22,966 INFO L226 Difference]: Without dead ends: 131 [2022-11-26 01:07:22,967 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-26 01:07:22,968 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 62 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 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-26 01:07:22,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 263 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-26 01:07:22,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-26 01:07:22,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 120. [2022-11-26 01:07:22,988 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-26 01:07:22,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 153 transitions. [2022-11-26 01:07:22,990 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 153 transitions. Word has length 12 [2022-11-26 01:07:22,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:22,990 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 153 transitions. [2022-11-26 01:07:22,991 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-26 01:07:22,991 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 153 transitions. [2022-11-26 01:07:22,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-26 01:07:22,991 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:22,992 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:23,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-26 01:07:23,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:23,198 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-26 01:07:23,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:23,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1005403790, now seen corresponding path program 1 times [2022-11-26 01:07:23,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:23,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495841231] [2022-11-26 01:07:23,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:23,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:23,379 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-26 01:07:23,380 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:23,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495841231] [2022-11-26 01:07:23,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495841231] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:23,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135117907] [2022-11-26 01:07:23,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:23,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:23,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:23,382 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:23,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 01:07:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:23,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-26 01:07:23,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:23,550 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-26 01:07:23,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:07:23,631 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-26 01:07:23,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135117907] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:07:23,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1257299634] [2022-11-26 01:07:23,644 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-26 01:07:23,644 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:07:23,645 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:07:23,645 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:07:23,645 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:07:23,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:23,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:23,673 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-26 01:07:23,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:23,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:23,779 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-26 01:07:23,788 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 62 for LOIs [2022-11-26 01:07:24,824 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-26 01:07:24,833 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-26 01:07:24,844 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-26 01:07:24,885 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-26 01:07:24,886 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-26 01:07:24,898 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-26 01:07:24,927 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-26 01:07:24,935 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-26 01:07:24,946 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-26 01:07:25,074 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:07:27,507 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-26 01:07:27,507 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:07:27,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:07:27,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-11-26 01:07:27,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932674473] [2022-11-26 01:07:27,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:07:27,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-26 01:07:27,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:27,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-26 01:07:27,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2022-11-26 01:07:27,509 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-26 01:07:27,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:27,879 INFO L93 Difference]: Finished difference Result 212 states and 254 transitions. [2022-11-26 01:07:27,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-26 01:07:27,880 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-26 01:07:27,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:27,881 INFO L225 Difference]: With dead ends: 212 [2022-11-26 01:07:27,881 INFO L226 Difference]: Without dead ends: 212 [2022-11-26 01:07:27,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2022-11-26 01:07:27,882 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 230 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:27,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 968 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-26 01:07:27,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-11-26 01:07:27,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 119. [2022-11-26 01:07:27,898 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-26 01:07:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 150 transitions. [2022-11-26 01:07:27,902 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 150 transitions. Word has length 13 [2022-11-26 01:07:27,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:27,902 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 150 transitions. [2022-11-26 01:07:27,904 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-26 01:07:27,905 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 150 transitions. [2022-11-26 01:07:27,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-26 01:07:27,905 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:27,905 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:27,918 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 01:07:28,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-26 01:07:28,112 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-26 01:07:28,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:28,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1574251492, now seen corresponding path program 1 times [2022-11-26 01:07:28,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:28,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053350937] [2022-11-26 01:07:28,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:28,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:28,177 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-26 01:07:28,177 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:28,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053350937] [2022-11-26 01:07:28,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053350937] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:28,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039518420] [2022-11-26 01:07:28,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:28,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:28,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:28,179 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:28,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 01:07:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:28,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 01:07:28,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:28,300 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-26 01:07:28,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:07:28,318 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-26 01:07:28,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039518420] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:07:28,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1318520658] [2022-11-26 01:07:28,321 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-26 01:07:28,321 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:07:28,321 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:07:28,322 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:07:28,322 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:07:28,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:28,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:28,340 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-26 01:07:28,579 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 30 for LOIs [2022-11-26 01:07:29,139 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-26 01:07:29,149 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-26 01:07:29,158 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-26 01:07:29,192 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-26 01:07:29,192 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-26 01:07:29,203 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-26 01:07:29,227 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-26 01:07:29,236 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-26 01:07:29,245 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-26 01:07:29,320 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:07:30,641 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-26 01:07:30,641 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:07:30,641 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:07:30,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-11-26 01:07:30,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852132088] [2022-11-26 01:07:30,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:07:30,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-26 01:07:30,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:30,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-26 01:07:30,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-11-26 01:07:30,643 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-26 01:07:30,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:30,751 INFO L93 Difference]: Finished difference Result 165 states and 201 transitions. [2022-11-26 01:07:30,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 01:07:30,752 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-26 01:07:30,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:30,753 INFO L225 Difference]: With dead ends: 165 [2022-11-26 01:07:30,753 INFO L226 Difference]: Without dead ends: 165 [2022-11-26 01:07:30,753 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-26 01:07:30,754 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 65 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:30,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 261 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:07:30,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-26 01:07:30,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 134. [2022-11-26 01:07:30,758 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-26 01:07:30,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 170 transitions. [2022-11-26 01:07:30,759 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 170 transitions. Word has length 15 [2022-11-26 01:07:30,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:30,759 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 170 transitions. [2022-11-26 01:07:30,760 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-26 01:07:30,760 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 170 transitions. [2022-11-26 01:07:30,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-26 01:07:30,760 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:30,760 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:30,774 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 01:07:30,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:30,970 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-26 01:07:30,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:30,970 INFO L85 PathProgramCache]: Analyzing trace with hash 13207570, now seen corresponding path program 2 times [2022-11-26 01:07:30,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:30,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235334896] [2022-11-26 01:07:30,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:30,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:31,231 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-26 01:07:31,231 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:31,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235334896] [2022-11-26 01:07:31,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235334896] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:31,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249793731] [2022-11-26 01:07:31,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 01:07:31,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:31,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:31,235 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:31,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-26 01:07:31,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-26 01:07:31,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:07:31,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-26 01:07:31,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:31,372 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-26 01:07:31,404 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-26 01:07:31,405 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-26 01:07:31,432 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-26 01:07:31,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-26 01:07:31,455 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-26 01:07:31,455 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-26 01:07:31,471 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-26 01:07:31,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:07:31,600 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-26 01:07:31,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249793731] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:07:31,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [926408330] [2022-11-26 01:07:31,602 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-26 01:07:31,602 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:07:31,603 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:07:31,603 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:07:31,603 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:07:31,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:31,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:31,624 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-26 01:07:31,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:31,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:31,696 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-26 01:07:31,704 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 62 for LOIs [2022-11-26 01:07:32,614 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-26 01:07:32,623 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-26 01:07:32,633 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-26 01:07:32,667 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-26 01:07:32,668 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-26 01:07:32,697 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-26 01:07:32,697 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-26 01:07:32,727 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-26 01:07:32,737 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-26 01:07:32,749 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-26 01:07:32,851 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:07:34,721 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-26 01:07:34,722 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:07:34,722 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:07:34,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-11-26 01:07:34,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504274208] [2022-11-26 01:07:34,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:07:34,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-26 01:07:34,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:34,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-26 01:07:34,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-11-26 01:07:34,724 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-26 01:07:34,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:34,865 INFO L93 Difference]: Finished difference Result 132 states and 166 transitions. [2022-11-26 01:07:34,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:07:34,865 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-26 01:07:34,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:34,866 INFO L225 Difference]: With dead ends: 132 [2022-11-26 01:07:34,866 INFO L226 Difference]: Without dead ends: 132 [2022-11-26 01:07:34,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-11-26 01:07:34,867 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 83 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:34,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 180 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:07:34,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-26 01:07:34,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-11-26 01:07:34,875 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-26 01:07:34,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 166 transitions. [2022-11-26 01:07:34,876 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 166 transitions. Word has length 19 [2022-11-26 01:07:34,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:34,876 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 166 transitions. [2022-11-26 01:07:34,876 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-26 01:07:34,877 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 166 transitions. [2022-11-26 01:07:34,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-26 01:07:34,881 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:34,881 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:34,892 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-26 01:07:35,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:35,087 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-26 01:07:35,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:35,088 INFO L85 PathProgramCache]: Analyzing trace with hash 13207571, now seen corresponding path program 1 times [2022-11-26 01:07:35,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:35,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747824119] [2022-11-26 01:07:35,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:35,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:35,420 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-26 01:07:35,420 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:35,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747824119] [2022-11-26 01:07:35,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747824119] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:35,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859392716] [2022-11-26 01:07:35,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:35,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:35,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:35,422 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:35,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-26 01:07:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:35,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-26 01:07:35,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:35,548 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-26 01:07:35,553 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-26 01:07:35,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:35,588 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-26 01:07:35,607 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-26 01:07:35,607 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-26 01:07:35,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:35,674 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-26 01:07:35,705 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-26 01:07:35,705 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-26 01:07:35,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:35,805 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-26 01:07:35,825 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-26 01:07:35,825 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-26 01:07:35,849 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-26 01:07:35,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:07:40,926 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-26 01:07:40,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859392716] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:07:40,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [734597456] [2022-11-26 01:07:40,929 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-26 01:07:40,929 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:07:40,929 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:07:40,929 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:07:40,930 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:07:40,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:40,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:40,950 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-26 01:07:41,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:41,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:41,021 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-26 01:07:41,028 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 62 for LOIs [2022-11-26 01:07:41,852 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-26 01:07:41,859 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-26 01:07:41,866 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-26 01:07:41,900 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-26 01:07:41,901 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-26 01:07:41,932 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-26 01:07:41,933 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-26 01:07:41,965 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-26 01:07:41,973 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-26 01:07:41,982 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-26 01:07:42,088 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:07:44,350 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-26 01:07:44,350 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:07:44,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:07:44,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 12 [2022-11-26 01:07:44,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492613137] [2022-11-26 01:07:44,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:07:44,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-26 01:07:44,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:44,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-26 01:07:44,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2022-11-26 01:07:44,352 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-26 01:07:44,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:44,842 INFO L93 Difference]: Finished difference Result 157 states and 192 transitions. [2022-11-26 01:07:44,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 01:07:44,842 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-26 01:07:44,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:44,843 INFO L225 Difference]: With dead ends: 157 [2022-11-26 01:07:44,844 INFO L226 Difference]: Without dead ends: 157 [2022-11-26 01:07:44,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2022-11-26 01:07:44,845 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 235 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:44,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 170 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-26 01:07:44,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-26 01:07:44,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 130. [2022-11-26 01:07:44,849 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-26 01:07:44,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 162 transitions. [2022-11-26 01:07:44,850 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 162 transitions. Word has length 19 [2022-11-26 01:07:44,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:44,851 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 162 transitions. [2022-11-26 01:07:44,851 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-26 01:07:44,851 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 162 transitions. [2022-11-26 01:07:44,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-26 01:07:44,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:44,852 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:44,863 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-26 01:07:45,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:45,053 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-26 01:07:45,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:45,053 INFO L85 PathProgramCache]: Analyzing trace with hash -192183934, now seen corresponding path program 1 times [2022-11-26 01:07:45,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:45,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316067528] [2022-11-26 01:07:45,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:45,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:45,165 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-26 01:07:45,165 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:45,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316067528] [2022-11-26 01:07:45,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316067528] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:45,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:45,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 01:07:45,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466752280] [2022-11-26 01:07:45,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:45,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:07:45,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:45,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:07:45,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:07:45,169 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-26 01:07:45,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:45,284 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2022-11-26 01:07:45,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:07:45,284 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-26 01:07:45,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:45,285 INFO L225 Difference]: With dead ends: 129 [2022-11-26 01:07:45,285 INFO L226 Difference]: Without dead ends: 129 [2022-11-26 01:07:45,286 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-26 01:07:45,286 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-26 01:07:45,287 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-26 01:07:45,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-26 01:07:45,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-11-26 01:07:45,290 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-26 01:07:45,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 160 transitions. [2022-11-26 01:07:45,292 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 160 transitions. Word has length 21 [2022-11-26 01:07:45,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:45,292 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 160 transitions. [2022-11-26 01:07:45,292 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-26 01:07:45,292 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 160 transitions. [2022-11-26 01:07:45,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-26 01:07:45,293 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:45,293 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:45,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-26 01:07:45,294 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-26 01:07:45,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:45,294 INFO L85 PathProgramCache]: Analyzing trace with hash -192183933, now seen corresponding path program 1 times [2022-11-26 01:07:45,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:45,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122054613] [2022-11-26 01:07:45,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:45,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:45,466 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-26 01:07:45,466 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:45,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122054613] [2022-11-26 01:07:45,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122054613] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:45,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:45,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 01:07:45,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017225121] [2022-11-26 01:07:45,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:45,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 01:07:45,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:45,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 01:07:45,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:07:45,469 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-26 01:07:45,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:45,575 INFO L93 Difference]: Finished difference Result 128 states and 158 transitions. [2022-11-26 01:07:45,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:07:45,576 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-26 01:07:45,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:45,577 INFO L225 Difference]: With dead ends: 128 [2022-11-26 01:07:45,577 INFO L226 Difference]: Without dead ends: 128 [2022-11-26 01:07:45,577 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-26 01:07:45,578 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 70 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:45,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 164 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:07:45,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-26 01:07:45,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-11-26 01:07:45,582 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-26 01:07:45,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2022-11-26 01:07:45,583 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 158 transitions. Word has length 21 [2022-11-26 01:07:45,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:45,584 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 158 transitions. [2022-11-26 01:07:45,584 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-26 01:07:45,584 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2022-11-26 01:07:45,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-26 01:07:45,585 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:45,585 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:45,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-26 01:07:45,585 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-26 01:07:45,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:45,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1662734635, now seen corresponding path program 1 times [2022-11-26 01:07:45,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:45,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155788218] [2022-11-26 01:07:45,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:45,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:46,047 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-26 01:07:46,047 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:46,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155788218] [2022-11-26 01:07:46,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155788218] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:46,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990965954] [2022-11-26 01:07:46,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:46,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:46,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:46,055 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:46,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-26 01:07:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:46,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-26 01:07:46,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:46,196 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-26 01:07:46,266 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-26 01:07:46,267 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-26 01:07:46,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:46,306 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-26 01:07:46,331 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-26 01:07:46,332 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-26 01:07:46,416 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-11-26 01:07:46,417 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-26 01:07:46,536 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-26 01:07:46,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:07:46,831 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-26 01:07:46,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990965954] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:07:46,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [692940816] [2022-11-26 01:07:46,833 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-26 01:07:46,833 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:07:46,834 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:07:46,834 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:07:46,834 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:07:46,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:46,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:46,853 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-26 01:07:46,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:46,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:46,932 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-26 01:07:46,938 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 62 for LOIs [2022-11-26 01:07:47,735 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-26 01:07:47,744 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-26 01:07:47,755 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-26 01:07:47,791 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-26 01:07:47,791 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-26 01:07:47,824 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-26 01:07:47,824 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-26 01:07:47,855 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-26 01:07:47,866 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-26 01:07:47,877 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-26 01:07:48,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 13 treesize of output 9 [2022-11-26 01:07:48,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:48,111 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-26 01:07:48,156 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-26 01:07:48,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:48,254 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-26 01:07:48,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:48,365 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 01:07:48,366 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-26 01:07:48,417 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-26 01:07:48,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:48,531 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-26 01:07:48,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:48,589 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-26 01:07:48,590 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-26 01:07:48,615 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-26 01:07:48,782 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:07:52,024 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3751#(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-26 01:07:52,025 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:07:52,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:07:52,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-11-26 01:07:52,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180977857] [2022-11-26 01:07:52,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:07:52,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 01:07:52,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:52,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 01:07:52,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2022-11-26 01:07:52,027 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-26 01:07:52,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:52,302 INFO L93 Difference]: Finished difference Result 147 states and 177 transitions. [2022-11-26 01:07:52,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 01:07:52,302 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-26 01:07:52,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:52,303 INFO L225 Difference]: With dead ends: 147 [2022-11-26 01:07:52,303 INFO L226 Difference]: Without dead ends: 147 [2022-11-26 01:07:52,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2022-11-26 01:07:52,304 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 192 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:52,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 204 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:07:52,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-11-26 01:07:52,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 124. [2022-11-26 01:07:52,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 88 states have (on average 1.6363636363636365) internal successors, (144), 117 states have internal predecessors, (144), 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-26 01:07:52,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 152 transitions. [2022-11-26 01:07:52,309 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 152 transitions. Word has length 22 [2022-11-26 01:07:52,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:52,310 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 152 transitions. [2022-11-26 01:07:52,310 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-26 01:07:52,310 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 152 transitions. [2022-11-26 01:07:52,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-26 01:07:52,311 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:52,311 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:52,319 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-26 01:07:52,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-26 01:07:52,517 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-26 01:07:52,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:52,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1662734634, now seen corresponding path program 1 times [2022-11-26 01:07:52,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:52,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219465023] [2022-11-26 01:07:52,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:52,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:53,021 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-26 01:07:53,022 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:53,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219465023] [2022-11-26 01:07:53,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219465023] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:53,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689339427] [2022-11-26 01:07:53,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:53,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:53,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:53,024 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:53,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-26 01:07:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:53,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-26 01:07:53,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:53,189 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-26 01:07:53,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:53,243 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-26 01:07:53,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:53,271 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-26 01:07:53,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:53,294 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-26 01:07:53,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:53,321 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-26 01:07:53,346 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-26 01:07:53,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:07:57,526 WARN L837 $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-26 01:07:59,602 WARN L837 $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-26 01:08:01,727 WARN L837 $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-26 01:08:03,777 WARN L837 $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-26 01:08:03,907 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-26 01:08:03,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689339427] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:08:03,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [598452038] [2022-11-26 01:08:03,910 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-26 01:08:03,910 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:08:03,910 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:08:03,911 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:08:03,911 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:08:03,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:03,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:03,929 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-26 01:08:03,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:03,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:03,991 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-26 01:08:03,996 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 62 for LOIs [2022-11-26 01:08:04,700 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-26 01:08:04,708 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-26 01:08:04,714 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-26 01:08:04,748 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-26 01:08:04,748 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-26 01:08:04,774 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-26 01:08:04,774 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-26 01:08:04,799 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-26 01:08:04,806 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-26 01:08:04,815 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-26 01:08:04,921 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-26 01:08:04,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:04,968 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-26 01:08:05,006 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-26 01:08:05,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:05,179 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 01:08:05,179 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-26 01:08:05,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:05,210 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-26 01:08:05,248 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-26 01:08:05,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:05,370 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-26 01:08:05,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:05,448 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-26 01:08:05,448 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-26 01:08:05,499 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-26 01:08:05,603 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:08:08,935 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4176#(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-26 01:08:08,935 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:08:08,935 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:08:08,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 6] total 12 [2022-11-26 01:08:08,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156672561] [2022-11-26 01:08:08,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:08:08,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 01:08:08,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:08:08,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 01:08:08,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=385, Unknown=4, NotChecked=172, Total=650 [2022-11-26 01:08:08,937 INFO L87 Difference]: Start difference. First operand 124 states and 152 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-26 01:08:09,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:08:09,284 INFO L93 Difference]: Finished difference Result 143 states and 171 transitions. [2022-11-26 01:08:09,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 01:08:09,285 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-26 01:08:09,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:08:09,286 INFO L225 Difference]: With dead ends: 143 [2022-11-26 01:08:09,286 INFO L226 Difference]: Without dead ends: 143 [2022-11-26 01:08:09,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=98, Invalid=420, Unknown=4, NotChecked=180, Total=702 [2022-11-26 01:08:09,288 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 200 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 349 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:08:09,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 129 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 213 Invalid, 0 Unknown, 349 Unchecked, 0.2s Time] [2022-11-26 01:08:09,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-26 01:08:09,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 120. [2022-11-26 01:08:09,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 88 states have (on average 1.5681818181818181) internal successors, (138), 113 states have internal predecessors, (138), 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-26 01:08:09,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2022-11-26 01:08:09,292 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 22 [2022-11-26 01:08:09,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:08:09,292 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2022-11-26 01:08:09,292 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-26 01:08:09,293 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-11-26 01:08:09,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-26 01:08:09,295 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:08:09,295 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-26 01:08:09,305 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-26 01:08:09,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-26 01:08:09,500 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-26 01:08:09,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:08:09,500 INFO L85 PathProgramCache]: Analyzing trace with hash -159940653, now seen corresponding path program 1 times [2022-11-26 01:08:09,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:08:09,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698516409] [2022-11-26 01:08:09,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:09,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:08:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:10,289 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-26 01:08:10,289 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:08:10,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698516409] [2022-11-26 01:08:10,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698516409] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:08:10,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731975183] [2022-11-26 01:08:10,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:10,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:08:10,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:08:10,291 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:08:10,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-26 01:08:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:10,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-26 01:08:10,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:08:10,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:10,697 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-26 01:08:10,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:10,708 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-26 01:08:10,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:10,849 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-26 01:08:10,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:10,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 19 treesize of output 18 [2022-11-26 01:08:11,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:11,073 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-26 01:08:11,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:11,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:11,113 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 01:08:11,113 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-26 01:08:11,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:11,229 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-26 01:08:11,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:11,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:11,255 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-26 01:08:11,256 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-26 01:08:11,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:11,315 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-26 01:08:11,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:11,327 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-26 01:08:11,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:11,373 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-26 01:08:11,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:11,380 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-26 01:08:11,419 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-26 01:08:11,424 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-26 01:08:11,428 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-26 01:08:11,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:08:11,549 WARN L837 $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-26 01:08:11,577 WARN L837 $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-26 01:08:11,612 WARN L837 $PredicateComparison]: unable to prove that (and (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_578 (Array Int Int)) (v_ArrVal_571 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |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|))))) (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 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_54| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_54|) 0 |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))))) is different from false [2022-11-26 01:08:16,389 WARN L837 $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-26 01:08:18,447 WARN L837 $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-26 01:08:20,542 WARN L837 $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-26 01:08:22,733 WARN L837 $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-26 01:08:24,835 WARN L837 $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-26 01:08:25,058 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-26 01:08:25,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731975183] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:08:25,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1378062800] [2022-11-26 01:08:25,060 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-26 01:08:25,061 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:08:25,061 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:08:25,061 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:08:25,061 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:08:25,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:25,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:25,081 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-26 01:08:25,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:25,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:25,150 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-26 01:08:25,154 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 62 for LOIs [2022-11-26 01:08:25,899 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-26 01:08:25,914 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-26 01:08:25,924 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-26 01:08:25,971 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-26 01:08:25,971 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-26 01:08:25,985 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-26 01:08:26,015 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-26 01:08:26,025 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-26 01:08:26,035 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-26 01:08:26,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:26,203 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-26 01:08:26,230 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-26 01:08:26,279 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-26 01:08:26,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:26,370 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-26 01:08:26,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:26,471 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 01:08:26,471 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-26 01:08:26,501 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-26 01:08:26,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:26,659 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-26 01:08:26,660 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-26 01:08:26,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:26,728 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-26 01:08:26,754 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-26 01:08:27,053 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:08:32,556 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4628#(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-26 01:08:32,556 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:08:32,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:08:32,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 13] total 32 [2022-11-26 01:08:32,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746621067] [2022-11-26 01:08:32,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:08:32,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-26 01:08:32,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:08:32,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-26 01:08:32,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1270, Unknown=34, NotChecked=648, Total=2162 [2022-11-26 01:08:32,560 INFO L87 Difference]: Start difference. First operand 120 states and 146 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-26 01:08:41,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 01:08:42,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:08:42,550 INFO L93 Difference]: Finished difference Result 174 states and 212 transitions. [2022-11-26 01:08:42,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-26 01:08:42,551 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-26 01:08:42,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:08:42,553 INFO L225 Difference]: With dead ends: 174 [2022-11-26 01:08:42,553 INFO L226 Difference]: Without dead ends: 174 [2022-11-26 01:08:42,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 25.9s TimeCoverageRelationStatistics Valid=319, Invalid=1659, Unknown=34, NotChecked=744, Total=2756 [2022-11-26 01:08:42,555 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 35 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 25 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 411 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:08:42,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1049 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 390 Invalid, 1 Unknown, 411 Unchecked, 3.0s Time] [2022-11-26 01:08:42,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-11-26 01:08:42,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2022-11-26 01:08:42,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 132 states have (on average 1.4242424242424243) internal successors, (188), 161 states have internal predecessors, (188), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (12), 4 states have call predecessors, (12), 8 states have call successors, (12) [2022-11-26 01:08:42,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 208 transitions. [2022-11-26 01:08:42,562 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 208 transitions. Word has length 24 [2022-11-26 01:08:42,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:08:42,562 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 208 transitions. [2022-11-26 01:08:42,563 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-26 01:08:42,563 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 208 transitions. [2022-11-26 01:08:42,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-26 01:08:42,564 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:08:42,564 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:08:42,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-26 01:08:42,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:08:42,771 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-26 01:08:42,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:08:42,772 INFO L85 PathProgramCache]: Analyzing trace with hash 2051013368, now seen corresponding path program 1 times [2022-11-26 01:08:42,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:08:42,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745055287] [2022-11-26 01:08:42,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:42,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:08:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:42,900 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-26 01:08:42,901 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:08:42,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745055287] [2022-11-26 01:08:42,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745055287] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:08:42,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093353415] [2022-11-26 01:08:42,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:42,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:08:42,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:08:42,903 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:08:42,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-26 01:08:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:43,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-26 01:08:43,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:08:43,153 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-26 01:08:43,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:08:43,410 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-26 01:08:43,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093353415] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:08:43,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1765429796] [2022-11-26 01:08:43,412 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2022-11-26 01:08:43,412 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:08:43,413 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:08:43,413 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:08:43,413 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:08:43,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:43,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:43,437 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-26 01:08:43,657 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-26 01:08:43,662 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 9 [2022-11-26 01:08:43,702 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-26 01:08:43,702 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-26 01:08:43,712 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-26 01:08:43,733 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-26 01:08:43,741 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 15 treesize of output 1 [2022-11-26 01:08:43,751 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-26 01:08:43,803 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-26 01:08:43,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 2 case distinctions, treesize of input 17 treesize of output 22 [2022-11-26 01:08:43,861 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-26 01:08:43,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 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-26 01:08:43,931 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-26 01:08:43,944 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:08:43,962 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 01:08:43,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 197 treesize of output 196 [2022-11-26 01:08:43,976 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:08:43,993 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 01:08:43,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 205 treesize of output 204 [2022-11-26 01:08:44,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:44,097 INFO L321 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2022-11-26 01:08:44,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 233 treesize of output 235 [2022-11-26 01:08:44,200 INFO L321 Elim1Store]: treesize reduction 98, result has 26.9 percent of original size [2022-11-26 01:08:44,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 236 treesize of output 256 [2022-11-26 01:08:44,258 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-26 01:08:44,264 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-26 01:08:44,271 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-26 01:08:44,301 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-26 01:08:44,303 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-26 01:08:44,335 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-26 01:08:44,336 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-26 01:08:44,352 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-26 01:08:44,358 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-26 01:08:44,364 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-26 01:08:44,400 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-26 01:08:44,452 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-26 01:08:44,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 114 treesize of output 123 [2022-11-26 01:08:44,483 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-26 01:08:44,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:44,552 INFO L321 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2022-11-26 01:08:44,553 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 131 treesize of output 141 [2022-11-26 01:08:44,592 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-26 01:08:44,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:44,607 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-26 01:08:44,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:44,643 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-26 01:08:44,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:44,682 INFO L321 Elim1Store]: treesize reduction 51, result has 12.1 percent of original size [2022-11-26 01:08:44,683 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 3 case distinctions, treesize of input 145 treesize of output 143 [2022-11-26 01:08:44,714 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-26 01:08:44,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:44,868 INFO L321 Elim1Store]: treesize reduction 48, result has 50.5 percent of original size [2022-11-26 01:08:44,868 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 4 case distinctions, treesize of input 35 treesize of output 65 [2022-11-26 01:08:44,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:44,962 INFO L321 Elim1Store]: treesize reduction 142, result has 14.5 percent of original size [2022-11-26 01:08:44,963 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 152 treesize of output 153 [2022-11-26 01:08:45,001 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-26 01:08:45,357 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 30 for LOIs [2022-11-26 01:08:45,779 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-26 01:08:45,788 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-26 01:08:45,797 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-26 01:08:45,836 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-26 01:08:45,837 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-26 01:08:45,879 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-26 01:08:45,879 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-26 01:08:45,908 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-26 01:08:45,917 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-26 01:08:45,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 11 treesize of output 7 [2022-11-26 01:08:46,039 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-26 01:08:46,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:46,061 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-26 01:08:46,090 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-26 01:08:46,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:46,179 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-26 01:08:46,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:46,244 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 01:08:46,245 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-26 01:08:46,266 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-26 01:08:46,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:46,374 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-26 01:08:46,374 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-26 01:08:46,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:46,400 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-26 01:08:46,460 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-26 01:08:46,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:46,660 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:08:46,682 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-26 01:08:46,683 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 3 case distinctions, treesize of input 35 treesize of output 37 [2022-11-26 01:08:46,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:46,745 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:08:46,778 INFO L321 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2022-11-26 01:08:46,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 42 treesize of output 43 [2022-11-26 01:08:46,828 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-26 01:08:46,901 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:08:51,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1765429796] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:08:51,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:08:51,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [5, 7, 7] total 31 [2022-11-26 01:08:51,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484318424] [2022-11-26 01:08:51,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:08:51,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-26 01:08:51,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:08:51,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-26 01:08:51,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=782, Unknown=0, NotChecked=0, Total=930 [2022-11-26 01:08:51,991 INFO L87 Difference]: Start difference. First operand 170 states and 208 transitions. Second operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 17 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-26 01:08:54,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:08:54,744 INFO L93 Difference]: Finished difference Result 242 states and 286 transitions. [2022-11-26 01:08:54,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-26 01:08:54,753 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 17 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 34 [2022-11-26 01:08:54,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:08:54,755 INFO L225 Difference]: With dead ends: 242 [2022-11-26 01:08:54,755 INFO L226 Difference]: Without dead ends: 242 [2022-11-26 01:08:54,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=167, Invalid=889, Unknown=0, NotChecked=0, Total=1056 [2022-11-26 01:08:54,756 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 162 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-26 01:08:54,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 249 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-26 01:08:54,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-11-26 01:08:54,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 173. [2022-11-26 01:08:54,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 135 states have (on average 1.4222222222222223) internal successors, (192), 164 states have internal predecessors, (192), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (12), 4 states have call predecessors, (12), 8 states have call successors, (12) [2022-11-26 01:08:54,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 212 transitions. [2022-11-26 01:08:54,766 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 212 transitions. Word has length 34 [2022-11-26 01:08:54,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:08:54,766 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 212 transitions. [2022-11-26 01:08:54,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 17 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-26 01:08:54,767 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 212 transitions. [2022-11-26 01:08:54,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-26 01:08:54,767 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:08:54,767 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:08:54,783 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-26 01:08:54,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-26 01:08:54,973 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-26 01:08:54,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:08:54,974 INFO L85 PathProgramCache]: Analyzing trace with hash -838435721, now seen corresponding path program 1 times [2022-11-26 01:08:54,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:08:54,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303489509] [2022-11-26 01:08:54,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:54,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:08:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:55,162 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-26 01:08:55,162 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:08:55,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303489509] [2022-11-26 01:08:55,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303489509] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:08:55,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538172131] [2022-11-26 01:08:55,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:55,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:08:55,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:08:55,171 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:08:55,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-26 01:08:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:55,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-26 01:08:55,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:08:55,422 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-26 01:08:55,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:08:55,636 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-26 01:08:55,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538172131] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:08:55,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1971945622] [2022-11-26 01:08:55,638 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-11-26 01:08:55,639 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:08:55,639 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:08:55,639 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:08:55,639 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:08:55,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:55,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:55,660 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-26 01:08:56,018 INFO L321 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2022-11-26 01:08:56,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 173 [2022-11-26 01:08:56,092 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:08:56,093 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 33 treesize of output 49 [2022-11-26 01:08:56,118 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 9 [2022-11-26 01:08:56,125 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-26 01:08:56,156 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:08:56,157 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 14 [2022-11-26 01:08:56,194 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-26 01:08:56,194 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-26 01:08:56,217 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 15 treesize of output 1 [2022-11-26 01:08:56,225 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-26 01:08:56,235 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-26 01:08:56,291 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-26 01:08:56,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 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-26 01:08:56,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2022-11-26 01:08:56,354 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-26 01:08:56,366 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:08:56,381 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 01:08:56,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 204 treesize of output 203 [2022-11-26 01:08:56,396 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:08:56,411 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-11-26 01:08:56,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 244 treesize of output 243 [2022-11-26 01:08:56,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:56,505 INFO L321 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2022-11-26 01:08:56,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 256 treesize of output 252 [2022-11-26 01:08:56,587 INFO L321 Elim1Store]: treesize reduction 98, result has 26.9 percent of original size [2022-11-26 01:08:56,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 259 treesize of output 279 [2022-11-26 01:08:56,649 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-26 01:08:56,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-26 01:08:56,663 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-26 01:08:56,700 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-26 01:08:56,700 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-26 01:08:56,716 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-26 01:08:56,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-26 01:08:56,738 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-26 01:08:56,744 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-26 01:08:56,805 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-26 01:08:56,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 114 treesize of output 123 [2022-11-26 01:08:56,833 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-26 01:08:56,859 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-26 01:08:56,894 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-26 01:08:56,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:56,938 INFO L321 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2022-11-26 01:08:56,938 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 131 treesize of output 141 [2022-11-26 01:08:56,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:56,986 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-26 01:08:57,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:57,044 INFO L321 Elim1Store]: treesize reduction 51, result has 12.1 percent of original size [2022-11-26 01:08:57,044 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 3 case distinctions, treesize of input 145 treesize of output 143 [2022-11-26 01:08:57,073 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-26 01:08:57,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:57,087 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-26 01:08:57,137 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-26 01:08:57,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:57,217 INFO L321 Elim1Store]: treesize reduction 142, result has 14.5 percent of original size [2022-11-26 01:08:57,217 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 152 treesize of output 153 [2022-11-26 01:08:57,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:57,338 INFO L321 Elim1Store]: treesize reduction 48, result has 50.5 percent of original size [2022-11-26 01:08:57,338 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 4 case distinctions, treesize of input 35 treesize of output 65 [2022-11-26 01:08:57,534 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 01:08:57,535 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 01:08:57,537 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 01:08:57,649 INFO L321 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2022-11-26 01:08:57,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 173 [2022-11-26 01:08:57,713 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:08:57,713 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 33 treesize of output 49 [2022-11-26 01:08:57,804 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 01:08:57,807 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 01:08:57,844 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 01:08:57,974 INFO L321 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2022-11-26 01:08:57,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 173 [2022-11-26 01:08:58,049 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:08:58,050 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 33 treesize of output 49 [2022-11-26 01:08:58,074 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 30 for LOIs [2022-11-26 01:08:58,502 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-26 01:08:58,510 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-26 01:08:58,519 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-26 01:08:58,570 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-26 01:08:58,571 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-26 01:08:58,583 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-26 01:08:58,609 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-26 01:08:58,630 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-26 01:08:58,641 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-26 01:08:58,728 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-26 01:08:58,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:58,764 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-26 01:08:58,793 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-26 01:08:58,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:58,904 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 01:08:58,904 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-26 01:08:58,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:58,930 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-26 01:08:58,962 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-26 01:08:59,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:59,067 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-26 01:08:59,067 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-26 01:08:59,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:59,112 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-26 01:08:59,161 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-26 01:08:59,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:59,356 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:08:59,378 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-26 01:08:59,379 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 3 case distinctions, treesize of input 35 treesize of output 37 [2022-11-26 01:08:59,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:59,439 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:08:59,475 INFO L321 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2022-11-26 01:08:59,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 42 treesize of output 43 [2022-11-26 01:08:59,528 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-26 01:08:59,609 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:09:05,235 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5870#(and (exists ((|v_ULTIMATE.start_main_~#head~1#1.base_27| Int)) (and (= |ULTIMATE.start_main_~ptr~0#1.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~#head~1#1.base_27|) 0)) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#head~1#1.base_27|) 0)) (= (select |#valid| |v_ULTIMATE.start_main_~#head~1#1.base_27|) 0) (<= 0 |v_ULTIMATE.start_main_~#head~1#1.base_27|) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#head~1#1.base_27|) 0) |ULTIMATE.start_sll_hierarchical_destroy_#in~head#1.base|) (= |ULTIMATE.start_sll_hierarchical_destroy_#in~head#1.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~#head~1#1.base_27|) 0)) (<= 4 (select |#length| |v_ULTIMATE.start_main_~#head~1#1.base_27|)))) (= |ULTIMATE.start_sll_hierarchical_destroy_~head#1.offset| 0) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (= 5 |ULTIMATE.start_main_~max~0#1|) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_main_~min~0#1| |ULTIMATE.start_main_~i~0#1|) (= 3 |ULTIMATE.start_main_~min~0#1|) (= |#NULL.offset| 0) (= |ULTIMATE.start_sll_hierarchical_destroy_#in~head#1.base| |ULTIMATE.start_sll_hierarchical_destroy_~head#1.base|) (= |ULTIMATE.start_main_~j~0#1| 0) (= 0 |ULTIMATE.start_sll_hierarchical_destroy_~head#1.base|) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_#res#1| 0) (= |#NULL.base| 0))' at error location [2022-11-26 01:09:05,235 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:09:05,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:09:05,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-11-26 01:09:05,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432521415] [2022-11-26 01:09:05,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:09:05,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 01:09:05,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:09:05,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 01:09:05,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1011, Unknown=0, NotChecked=0, Total=1190 [2022-11-26 01:09:05,238 INFO L87 Difference]: Start difference. First operand 173 states and 212 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 01:09:05,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:09:05,565 INFO L93 Difference]: Finished difference Result 208 states and 249 transitions. [2022-11-26 01:09:05,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-26 01:09:05,566 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2022-11-26 01:09:05,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:09:05,568 INFO L225 Difference]: With dead ends: 208 [2022-11-26 01:09:05,568 INFO L226 Difference]: Without dead ends: 198 [2022-11-26 01:09:05,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=216, Invalid=1266, Unknown=0, NotChecked=0, Total=1482 [2022-11-26 01:09:05,570 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 223 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:09:05,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 384 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:09:05,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-11-26 01:09:05,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 188. [2022-11-26 01:09:05,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 150 states have (on average 1.4266666666666667) internal successors, (214), 179 states have internal predecessors, (214), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (12), 4 states have call predecessors, (12), 8 states have call successors, (12) [2022-11-26 01:09:05,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 234 transitions. [2022-11-26 01:09:05,579 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 234 transitions. Word has length 35 [2022-11-26 01:09:05,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:09:05,579 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 234 transitions. [2022-11-26 01:09:05,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 01:09:05,580 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 234 transitions. [2022-11-26 01:09:05,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-26 01:09:05,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:09:05,581 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:09:05,595 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-11-26 01:09:05,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-26 01:09:05,788 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-26 01:09:05,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:09:05,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1789511590, now seen corresponding path program 2 times [2022-11-26 01:09:05,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:09:05,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816115207] [2022-11-26 01:09:05,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:09:05,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:09:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:09:06,024 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 01:09:06,024 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:09:06,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816115207] [2022-11-26 01:09:06,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816115207] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:09:06,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377485078] [2022-11-26 01:09:06,024 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 01:09:06,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:09:06,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:09:06,026 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:09:06,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-26 01:09:06,196 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-26 01:09:06,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:09:06,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-26 01:09:06,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:09:06,404 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-26 01:09:06,459 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 16 treesize of output 8 [2022-11-26 01:09:06,477 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-26 01:09:06,477 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 01:09:06,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377485078] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:09:06,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 01:09:06,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-11-26 01:09:06,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839948221] [2022-11-26 01:09:06,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:09:06,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-26 01:09:06,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:09:06,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-26 01:09:06,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-11-26 01:09:06,480 INFO L87 Difference]: Start difference. First operand 188 states and 234 transitions. Second operand has 8 states, 8 states have (on average 3.125) 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-26 01:09:06,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:09:06,845 INFO L93 Difference]: Finished difference Result 291 states and 362 transitions. [2022-11-26 01:09:06,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-26 01:09:06,846 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) 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 38 [2022-11-26 01:09:06,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:09:06,847 INFO L225 Difference]: With dead ends: 291 [2022-11-26 01:09:06,848 INFO L226 Difference]: Without dead ends: 291 [2022-11-26 01:09:06,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2022-11-26 01:09:06,849 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 195 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-26 01:09:06,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 360 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-26 01:09:06,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-11-26 01:09:06,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 202. [2022-11-26 01:09:06,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 164 states have (on average 1.4451219512195121) internal successors, (237), 192 states have internal predecessors, (237), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (12), 5 states have call predecessors, (12), 8 states have call successors, (12) [2022-11-26 01:09:06,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 257 transitions. [2022-11-26 01:09:06,859 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 257 transitions. Word has length 38 [2022-11-26 01:09:06,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:09:06,859 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 257 transitions. [2022-11-26 01:09:06,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) 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-26 01:09:06,860 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 257 transitions. [2022-11-26 01:09:06,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-26 01:09:06,861 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:09:06,861 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:09:06,872 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-26 01:09:07,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:09:07,067 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-26 01:09:07,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:09:07,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1794172081, now seen corresponding path program 1 times [2022-11-26 01:09:07,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:09:07,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882785653] [2022-11-26 01:09:07,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:09:07,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:09:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:09:07,331 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-26 01:09:07,331 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:09:07,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882785653] [2022-11-26 01:09:07,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882785653] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:09:07,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:09:07,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-26 01:09:07,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067513800] [2022-11-26 01:09:07,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:09:07,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-26 01:09:07,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:09:07,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-26 01:09:07,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-26 01:09:07,333 INFO L87 Difference]: Start difference. First operand 202 states and 257 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-26 01:09:07,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:09:07,893 INFO L93 Difference]: Finished difference Result 341 states and 424 transitions. [2022-11-26 01:09:07,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-26 01:09:07,893 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 38 [2022-11-26 01:09:07,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:09:07,895 INFO L225 Difference]: With dead ends: 341 [2022-11-26 01:09:07,895 INFO L226 Difference]: Without dead ends: 341 [2022-11-26 01:09:07,896 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-26 01:09:07,896 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 188 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-26 01:09:07,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 320 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-26 01:09:07,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-11-26 01:09:07,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 206. [2022-11-26 01:09:07,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 169 states have (on average 1.4437869822485208) internal successors, (244), 196 states have internal predecessors, (244), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (12), 5 states have call predecessors, (12), 8 states have call successors, (12) [2022-11-26 01:09:07,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 264 transitions. [2022-11-26 01:09:07,914 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 264 transitions. Word has length 38 [2022-11-26 01:09:07,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:09:07,915 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 264 transitions. [2022-11-26 01:09:07,915 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-26 01:09:07,915 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 264 transitions. [2022-11-26 01:09:07,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-26 01:09:07,917 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:09:07,917 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:09:07,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-26 01:09:07,917 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-26 01:09:07,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:09:07,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1794172080, now seen corresponding path program 1 times [2022-11-26 01:09:07,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:09:07,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243191385] [2022-11-26 01:09:07,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:09:07,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:09:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:09:08,166 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 01:09:08,166 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:09:08,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243191385] [2022-11-26 01:09:08,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243191385] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:09:08,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159472147] [2022-11-26 01:09:08,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:09:08,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:09:08,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:09:08,171 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:09:08,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-26 01:09:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:09:08,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-26 01:09:08,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:09:08,467 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-26 01:09:08,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:09:08,778 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-26 01:09:08,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159472147] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:09:08,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1868201229] [2022-11-26 01:09:08,781 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-11-26 01:09:08,781 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:09:08,781 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:09:08,781 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:09:08,781 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:09:08,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:08,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:08,809 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-26 01:09:09,130 INFO L321 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2022-11-26 01:09:09,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 173 [2022-11-26 01:09:09,215 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:09:09,215 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 33 treesize of output 49 [2022-11-26 01:09:09,239 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 9 [2022-11-26 01:09:09,246 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-26 01:09:09,282 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-26 01:09:09,283 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-26 01:09:09,293 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-26 01:09:09,323 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 15 treesize of output 1 [2022-11-26 01:09:09,336 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-26 01:09:09,345 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-26 01:09:09,402 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-26 01:09:09,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 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-26 01:09:09,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 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-26 01:09:09,474 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:09:09,489 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 01:09:09,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 197 treesize of output 196 [2022-11-26 01:09:09,502 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:09:09,518 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-11-26 01:09:09,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 233 treesize of output 232 [2022-11-26 01:09:09,555 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-26 01:09:09,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:09,624 INFO L321 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2022-11-26 01:09:09,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 233 treesize of output 235 [2022-11-26 01:09:09,714 INFO L321 Elim1Store]: treesize reduction 98, result has 26.9 percent of original size [2022-11-26 01:09:09,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 236 treesize of output 256 [2022-11-26 01:09:09,772 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-26 01:09:09,779 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-26 01:09:09,786 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-26 01:09:09,813 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-26 01:09:09,814 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-26 01:09:09,843 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-26 01:09:09,843 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-26 01:09:09,860 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-26 01:09:09,867 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-26 01:09:09,873 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-26 01:09:09,903 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-26 01:09:09,945 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-26 01:09:09,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 114 treesize of output 123 [2022-11-26 01:09:09,981 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-26 01:09:10,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:10,005 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-26 01:09:10,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:10,059 INFO L321 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2022-11-26 01:09:10,059 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 131 treesize of output 141 [2022-11-26 01:09:10,096 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-26 01:09:10,131 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-26 01:09:10,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:10,142 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-26 01:09:10,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:10,181 INFO L321 Elim1Store]: treesize reduction 51, result has 12.1 percent of original size [2022-11-26 01:09:10,182 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 3 case distinctions, treesize of input 145 treesize of output 143 [2022-11-26 01:09:10,264 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-26 01:09:10,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:10,356 INFO L321 Elim1Store]: treesize reduction 48, result has 50.5 percent of original size [2022-11-26 01:09:10,357 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 4 case distinctions, treesize of input 35 treesize of output 65 [2022-11-26 01:09:10,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:10,453 INFO L321 Elim1Store]: treesize reduction 142, result has 14.5 percent of original size [2022-11-26 01:09:10,454 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 152 treesize of output 153 [2022-11-26 01:09:10,694 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 01:09:10,695 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 01:09:10,802 INFO L321 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2022-11-26 01:09:10,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 173 [2022-11-26 01:09:10,866 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:09:10,866 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 33 treesize of output 49 [2022-11-26 01:09:11,001 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 01:09:11,003 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 01:09:11,005 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-26 01:09:11,153 INFO L321 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2022-11-26 01:09:11,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 173 [2022-11-26 01:09:11,217 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:09:11,217 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 33 treesize of output 49 [2022-11-26 01:09:11,228 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 30 for LOIs [2022-11-26 01:09:11,595 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-26 01:09:11,603 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-26 01:09:11,612 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-26 01:09:11,646 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-26 01:09:11,646 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-26 01:09:11,681 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-26 01:09:11,682 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-26 01:09:11,710 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-26 01:09:11,718 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-26 01:09:11,728 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-26 01:09:11,821 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-26 01:09:11,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:11,843 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-26 01:09:11,882 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-26 01:09:11,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:11,942 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-26 01:09:11,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:12,014 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 01:09:12,014 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-26 01:09:12,037 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-26 01:09:12,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:12,129 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-26 01:09:12,129 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-26 01:09:12,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:12,177 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-26 01:09:12,200 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-26 01:09:12,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:12,426 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:09:12,457 INFO L321 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2022-11-26 01:09:12,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 42 treesize of output 43 [2022-11-26 01:09:12,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:12,488 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:09:12,507 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-26 01:09:12,508 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 3 case distinctions, treesize of input 35 treesize of output 37 [2022-11-26 01:09:12,583 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-26 01:09:12,652 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:09:18,305 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7722#(and (= |ULTIMATE.start_main_~ptr~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#head~1#1.base|) |ULTIMATE.start_main_~#head~1#1.offset|)) (or (not (<= (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|))) (not (<= 0 (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#head~1#1.base|) |ULTIMATE.start_main_~#head~1#1.offset|) |ULTIMATE.start_main_~ptr~0#1.base|) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (= 5 |ULTIMATE.start_main_~max~0#1|) (= |ULTIMATE.start_main_~#head~1#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#head~1#1.base|) (= |ULTIMATE.start_main_~min~0#1| |ULTIMATE.start_main_~i~0#1|) (= 3 |ULTIMATE.start_main_~min~0#1|) (<= (+ |ULTIMATE.start_main_~#head~1#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#head~1#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#head~1#1.base|) 1) (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-26 01:09:18,305 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:09:18,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:09:18,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-11-26 01:09:18,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066623199] [2022-11-26 01:09:18,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:09:18,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-26 01:09:18,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:09:18,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-26 01:09:18,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=892, Unknown=0, NotChecked=0, Total=1056 [2022-11-26 01:09:18,307 INFO L87 Difference]: Start difference. First operand 206 states and 264 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 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-26 01:09:18,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:09:18,713 INFO L93 Difference]: Finished difference Result 251 states and 305 transitions. [2022-11-26 01:09:18,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-26 01:09:18,713 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 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 38 [2022-11-26 01:09:18,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:09:18,715 INFO L225 Difference]: With dead ends: 251 [2022-11-26 01:09:18,715 INFO L226 Difference]: Without dead ends: 241 [2022-11-26 01:09:18,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 84 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=231, Invalid=1251, Unknown=0, NotChecked=0, Total=1482 [2022-11-26 01:09:18,717 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 241 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-26 01:09:18,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 437 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-26 01:09:18,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-11-26 01:09:18,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 212. [2022-11-26 01:09:18,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 175 states have (on average 1.4342857142857144) internal successors, (251), 202 states have internal predecessors, (251), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (12), 5 states have call predecessors, (12), 8 states have call successors, (12) [2022-11-26 01:09:18,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 271 transitions. [2022-11-26 01:09:18,725 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 271 transitions. Word has length 38 [2022-11-26 01:09:18,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:09:18,726 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 271 transitions. [2022-11-26 01:09:18,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 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-26 01:09:18,726 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 271 transitions. [2022-11-26 01:09:18,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-26 01:09:18,727 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:09:18,727 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-26 01:09:18,743 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-26 01:09:18,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:09:18,934 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-26 01:09:18,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:09:18,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1396133747, now seen corresponding path program 2 times [2022-11-26 01:09:18,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:09:18,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432242668] [2022-11-26 01:09:18,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:09:18,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:09:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:09:19,416 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-26 01:09:19,416 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:09:19,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432242668] [2022-11-26 01:09:19,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432242668] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:09:19,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:09:19,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-26 01:09:19,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980624325] [2022-11-26 01:09:19,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:09:19,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-26 01:09:19,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:09:19,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-26 01:09:19,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-26 01:09:19,418 INFO L87 Difference]: Start difference. First operand 212 states and 271 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-26 01:09:19,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:09:19,953 INFO L93 Difference]: Finished difference Result 298 states and 378 transitions. [2022-11-26 01:09:19,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-26 01:09:19,954 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-26 01:09:19,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:09:19,955 INFO L225 Difference]: With dead ends: 298 [2022-11-26 01:09:19,955 INFO L226 Difference]: Without dead ends: 298 [2022-11-26 01:09:19,956 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-26 01:09:19,956 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 152 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-26 01:09:19,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 294 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-26 01:09:19,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-11-26 01:09:19,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 213. [2022-11-26 01:09:19,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 176 states have (on average 1.4261363636363635) internal successors, (251), 203 states have internal predecessors, (251), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (12), 5 states have call predecessors, (12), 8 states have call successors, (12) [2022-11-26 01:09:19,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 271 transitions. [2022-11-26 01:09:19,966 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 271 transitions. Word has length 41 [2022-11-26 01:09:19,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:09:19,967 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 271 transitions. [2022-11-26 01:09:19,967 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-26 01:09:19,967 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 271 transitions. [2022-11-26 01:09:19,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-26 01:09:19,968 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:09:19,968 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-26 01:09:19,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-26 01:09:19,968 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-26 01:09:19,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:09:19,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1654615867, now seen corresponding path program 1 times [2022-11-26 01:09:19,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:09:19,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234479895] [2022-11-26 01:09:19,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:09:19,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:09:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:09:21,138 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-26 01:09:21,138 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:09:21,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234479895] [2022-11-26 01:09:21,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234479895] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:09:21,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:09:21,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-26 01:09:21,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026884261] [2022-11-26 01:09:21,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:09:21,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 01:09:21,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:09:21,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 01:09:21,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-11-26 01:09:21,140 INFO L87 Difference]: Start difference. First operand 213 states and 271 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-26 01:09:22,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:09:22,556 INFO L93 Difference]: Finished difference Result 386 states and 483 transitions. [2022-11-26 01:09:22,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-26 01:09:22,557 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-26 01:09:22,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:09:22,565 INFO L225 Difference]: With dead ends: 386 [2022-11-26 01:09:22,565 INFO L226 Difference]: Without dead ends: 386 [2022-11-26 01:09:22,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2022-11-26 01:09:22,568 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 412 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:09:22,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 549 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-26 01:09:22,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-11-26 01:09:22,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 229. [2022-11-26 01:09:22,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 192 states have (on average 1.4375) internal successors, (276), 218 states have internal predecessors, (276), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (12), 6 states have call predecessors, (12), 8 states have call successors, (12) [2022-11-26 01:09:22,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 296 transitions. [2022-11-26 01:09:22,586 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 296 transitions. Word has length 43 [2022-11-26 01:09:22,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:09:22,586 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 296 transitions. [2022-11-26 01:09:22,586 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-26 01:09:22,587 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 296 transitions. [2022-11-26 01:09:22,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-26 01:09:22,588 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:09:22,588 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-26 01:09:22,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-26 01:09:22,590 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-26 01:09:22,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:09:22,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1654615866, now seen corresponding path program 1 times [2022-11-26 01:09:22,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:09:22,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804851625] [2022-11-26 01:09:22,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:09:22,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:09:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:09:24,363 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-26 01:09:24,363 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:09:24,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804851625] [2022-11-26 01:09:24,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804851625] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:09:24,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:09:24,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-26 01:09:24,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490862298] [2022-11-26 01:09:24,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:09:24,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-26 01:09:24,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:09:24,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-26 01:09:24,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-11-26 01:09:24,365 INFO L87 Difference]: Start difference. First operand 229 states and 296 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-26 01:09:25,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:09:25,923 INFO L93 Difference]: Finished difference Result 433 states and 533 transitions. [2022-11-26 01:09:25,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-26 01:09:25,925 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-26 01:09:25,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:09:25,928 INFO L225 Difference]: With dead ends: 433 [2022-11-26 01:09:25,928 INFO L226 Difference]: Without dead ends: 433 [2022-11-26 01:09:25,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=117, Invalid=639, Unknown=0, NotChecked=0, Total=756 [2022-11-26 01:09:25,929 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 541 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-26 01:09:25,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 348 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-26 01:09:25,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-11-26 01:09:25,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 229. [2022-11-26 01:09:25,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 192 states have (on average 1.4322916666666667) internal successors, (275), 218 states have internal predecessors, (275), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (12), 6 states have call predecessors, (12), 8 states have call successors, (12) [2022-11-26 01:09:25,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 295 transitions. [2022-11-26 01:09:25,944 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 295 transitions. Word has length 43 [2022-11-26 01:09:25,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:09:25,944 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 295 transitions. [2022-11-26 01:09:25,945 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-26 01:09:25,945 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 295 transitions. [2022-11-26 01:09:25,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-26 01:09:25,946 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:09:25,946 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-26 01:09:25,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-26 01:09:25,946 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-26 01:09:25,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:09:25,947 INFO L85 PathProgramCache]: Analyzing trace with hash -947831941, now seen corresponding path program 1 times [2022-11-26 01:09:25,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:09:25,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656763384] [2022-11-26 01:09:25,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:09:25,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:09:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:09:29,518 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-26 01:09:29,519 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:09:29,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656763384] [2022-11-26 01:09:29,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656763384] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:09:29,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275064578] [2022-11-26 01:09:29,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:09:29,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:09:29,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:09:29,520 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:09:29,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7b0694c-2924-4a92-88be-79983945f2d6/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-26 01:09:29,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:09:29,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 123 conjunts are in the unsatisfiable core [2022-11-26 01:09:29,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:09:29,740 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-26 01:09:30,106 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-26 01:09:30,333 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-26 01:09:30,333 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-26 01:09:30,473 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-26 01:09:30,483 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-26 01:09:30,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:30,777 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-26 01:09:30,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:30,792 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-26 01:09:30,973 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-26 01:09:30,973 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 64 treesize of output 49 [2022-11-26 01:09:31,032 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-26 01:09:31,033 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-26 01:09:31,261 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-26 01:09:31,261 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 99 treesize of output 72 [2022-11-26 01:09:31,388 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-26 01:09:31,388 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-26 01:09:32,283 INFO L321 Elim1Store]: treesize reduction 68, result has 50.7 percent of original size [2022-11-26 01:09:32,295 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-26 01:09:32,365 INFO L321 Elim1Store]: treesize reduction 108, result has 21.7 percent of original size [2022-11-26 01:09:32,365 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-26 01:09:33,202 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-26 01:09:33,202 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-26 01:09:34,884 INFO L321 Elim1Store]: treesize reduction 308, result has 32.6 percent of original size [2022-11-26 01:09:34,885 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-26 01:09:35,379 INFO L321 Elim1Store]: treesize reduction 184, result has 49.6 percent of original size [2022-11-26 01:09:35,380 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 309