./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a 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_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fabf091179f48b7141dc193b5040f4974c042bd8a2afb03b99137d693bf63ce7 --- 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-5e519f3 [2022-11-03 02:31:32,828 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:31:32,830 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:31:32,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:31:32,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:31:32,877 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:31:32,883 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:31:32,885 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:31:32,886 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:31:32,887 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:31:32,888 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:31:32,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:31:32,890 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:31:32,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:31:32,892 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:31:32,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:31:32,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:31:32,901 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:31:32,904 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:31:32,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:31:32,917 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:31:32,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:31:32,921 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:31:32,922 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:31:32,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:31:32,926 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:31:32,926 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:31:32,935 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:31:32,935 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:31:32,936 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:31:32,936 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:31:32,937 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:31:32,938 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:31:32,939 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:31:32,940 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:31:32,940 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:31:32,941 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:31:32,941 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:31:32,941 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:31:32,942 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:31:32,943 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:31:32,946 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-03 02:31:32,990 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:31:32,990 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:31:32,990 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:31:32,990 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:31:32,991 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:31:32,991 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:31:32,991 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:31:32,992 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:31:32,992 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:31:32,992 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:31:32,992 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:31:32,992 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:31:32,992 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:31:32,993 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:31:32,993 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:31:32,993 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:31:32,993 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:31:32,993 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:31:32,994 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-03 02:31:32,997 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-03 02:31:32,997 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:31:32,998 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:31:32,998 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 02:31:32,998 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:31:32,998 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:31:32,999 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:31:32,999 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-03 02:31:32,999 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-03 02:31:33,000 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-03 02:31:33,000 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:31:33,000 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 02:31:33,000 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:31:33,001 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:31:33,001 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:31:33,001 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:31:33,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:31:33,002 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:31:33,003 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:31:33,003 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:31:33,003 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:31:33,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:31:33,003 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:31:33,003 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_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/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_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> fabf091179f48b7141dc193b5040f4974c042bd8a2afb03b99137d693bf63ce7 [2022-11-03 02:31:33,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:31:33,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:31:33,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:31:33,331 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:31:33,332 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:31:33,334 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i [2022-11-03 02:31:33,414 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/data/244e64b6c/b11f2e40739e415e9c7cb69b6f3b78e2/FLAGb0cc5b84a [2022-11-03 02:31:33,984 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:31:33,985 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i [2022-11-03 02:31:34,003 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/data/244e64b6c/b11f2e40739e415e9c7cb69b6f3b78e2/FLAGb0cc5b84a [2022-11-03 02:31:34,292 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/data/244e64b6c/b11f2e40739e415e9c7cb69b6f3b78e2 [2022-11-03 02:31:34,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:31:34,308 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:31:34,310 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:31:34,310 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:31:34,314 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:31:34,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:31:34" (1/1) ... [2022-11-03 02:31:34,318 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1274cf48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:31:34, skipping insertion in model container [2022-11-03 02:31:34,318 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:31:34" (1/1) ... [2022-11-03 02:31:34,326 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:31:34,389 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:31:34,804 WARN L230 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_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i[24987,25000] [2022-11-03 02:31:34,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:31:34,819 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:31:34,871 WARN L230 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_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i[24987,25000] [2022-11-03 02:31:34,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:31:34,906 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:31:34,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:31:34 WrapperNode [2022-11-03 02:31:34,907 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:31:34,908 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:31:34,908 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:31:34,908 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:31:34,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:31:34" (1/1) ... [2022-11-03 02:31:34,959 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:31:34" (1/1) ... [2022-11-03 02:31:35,000 INFO L138 Inliner]: procedures = 129, calls = 39, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 185 [2022-11-03 02:31:35,001 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:31:35,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:31:35,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:31:35,002 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:31:35,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:31:34" (1/1) ... [2022-11-03 02:31:35,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:31:34" (1/1) ... [2022-11-03 02:31:35,014 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:31:34" (1/1) ... [2022-11-03 02:31:35,014 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:31:34" (1/1) ... [2022-11-03 02:31:35,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:31:34" (1/1) ... [2022-11-03 02:31:35,039 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:31:34" (1/1) ... [2022-11-03 02:31:35,041 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:31:34" (1/1) ... [2022-11-03 02:31:35,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:31:34" (1/1) ... [2022-11-03 02:31:35,048 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:31:35,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:31:35,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:31:35,054 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:31:35,055 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:31:34" (1/1) ... [2022-11-03 02:31:35,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:31:35,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:31:35,088 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:31:35,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:31:35,141 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-03 02:31:35,142 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-03 02:31:35,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 02:31:35,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:31:35,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:31:35,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 02:31:35,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 02:31:35,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:31:35,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-03 02:31:35,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:31:35,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:31:35,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:31:35,266 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:31:35,269 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:31:35,313 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-03 02:31:35,786 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:31:35,899 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:31:35,899 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-11-03 02:31:35,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:31:35 BoogieIcfgContainer [2022-11-03 02:31:35,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:31:35,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:31:35,908 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:31:35,920 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:31:35,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:31:34" (1/3) ... [2022-11-03 02:31:35,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ab63b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:31:35, skipping insertion in model container [2022-11-03 02:31:35,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:31:34" (2/3) ... [2022-11-03 02:31:35,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ab63b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:31:35, skipping insertion in model container [2022-11-03 02:31:35,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:31:35" (3/3) ... [2022-11-03 02:31:35,922 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-1.i [2022-11-03 02:31:35,940 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:31:35,940 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2022-11-03 02:31:35,983 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:31:35,995 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;@150202a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:31:35,995 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2022-11-03 02:31:36,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 49 states have (on average 2.2244897959183674) internal successors, (109), 92 states have internal predecessors, (109), 2 states have call successors, (2), 1 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-03 02:31:36,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 02:31:36,011 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:31:36,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 02:31:36,013 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:31:36,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:31:36,022 INFO L85 PathProgramCache]: Analyzing trace with hash 295585, now seen corresponding path program 1 times [2022-11-03 02:31:36,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:31:36,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113435351] [2022-11-03 02:31:36,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:36,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:31:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:36,332 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-03 02:31:36,333 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:31:36,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113435351] [2022-11-03 02:31:36,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113435351] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:31:36,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:31:36,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 02:31:36,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971070038] [2022-11-03 02:31:36,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:31:36,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:31:36,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:31:36,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:31:36,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:31:36,387 INFO L87 Difference]: Start difference. First operand has 94 states, 49 states have (on average 2.2244897959183674) internal successors, (109), 92 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:36,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:31:36,588 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2022-11-03 02:31:36,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:31:36,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-03 02:31:36,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:31:36,600 INFO L225 Difference]: With dead ends: 115 [2022-11-03 02:31:36,600 INFO L226 Difference]: Without dead ends: 110 [2022-11-03 02:31:36,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-03 02:31:36,607 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 93 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:31:36,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 70 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:31:36,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-03 02:31:36,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 87. [2022-11-03 02:31:36,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 47 states have (on average 2.106382978723404) internal successors, (99), 86 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:36,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2022-11-03 02:31:36,657 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 3 [2022-11-03 02:31:36,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:31:36,657 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2022-11-03 02:31:36,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:36,660 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2022-11-03 02:31:36,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 02:31:36,660 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:31:36,661 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 02:31:36,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:31:36,662 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:31:36,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:31:36,663 INFO L85 PathProgramCache]: Analyzing trace with hash 295586, now seen corresponding path program 1 times [2022-11-03 02:31:36,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:31:36,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933914020] [2022-11-03 02:31:36,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:36,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:31:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:36,728 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-03 02:31:36,728 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:31:36,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933914020] [2022-11-03 02:31:36,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933914020] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:31:36,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:31:36,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:31:36,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102350472] [2022-11-03 02:31:36,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:31:36,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:31:36,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:31:36,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:31:36,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:31:36,732 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:36,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:31:36,822 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2022-11-03 02:31:36,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:31:36,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-03 02:31:36,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:31:36,824 INFO L225 Difference]: With dead ends: 125 [2022-11-03 02:31:36,824 INFO L226 Difference]: Without dead ends: 125 [2022-11-03 02:31:36,824 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-03 02:31:36,826 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 41 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:31:36,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 137 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:31:36,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-03 02:31:36,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 88. [2022-11-03 02:31:36,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 87 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:36,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2022-11-03 02:31:36,856 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 3 [2022-11-03 02:31:36,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:31:36,857 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2022-11-03 02:31:36,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:36,857 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2022-11-03 02:31:36,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 02:31:36,858 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:31:36,858 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:31:36,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:31:36,858 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:31:36,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:31:36,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1113659344, now seen corresponding path program 1 times [2022-11-03 02:31:36,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:31:36,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078543274] [2022-11-03 02:31:36,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:36,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:31:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:36,960 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-03 02:31:36,961 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:31:36,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078543274] [2022-11-03 02:31:36,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078543274] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:31:36,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032132963] [2022-11-03 02:31:36,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:36,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:31:36,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:31:36,966 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:31:36,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 02:31:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:37,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 02:31:37,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:31:37,118 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-03 02:31:37,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:31:37,141 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-03 02:31:37,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032132963] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:31:37,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1326744511] [2022-11-03 02:31:37,160 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-03 02:31:37,161 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:31:37,165 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:31:37,172 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:31:37,172 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:31:37,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:37,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:37,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:31:37,766 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:31:38,135 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '561#(and (<= 3 |ULTIMATE.start_main_~min~0#1|) (<= 0 |#NULL.base|) (<= |ULTIMATE.start_main_~max~0#1| 5) (< (select |#length| |ULTIMATE.start_main_~#head~1#1.base|) (+ |ULTIMATE.start_main_~#head~1#1.offset| 4)) (<= |ULTIMATE.start_main_~#head~1#1.offset| 0) (not (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~max~0#1|)) (<= 5 |ULTIMATE.start_main_~max~0#1|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#head~1#1.base|) (<= 0 |ULTIMATE.start_main_~#head~1#1.offset|) (<= |ULTIMATE.start_main_~min~0#1| 3) (<= |#NULL.base| 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2022-11-03 02:31:38,135 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:31:38,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:31:38,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-11-03 02:31:38,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987025271] [2022-11-03 02:31:38,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:31:38,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:31:38,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:31:38,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:31:38,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:31:38,137 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:38,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:31:38,405 INFO L93 Difference]: Finished difference Result 197 states and 218 transitions. [2022-11-03 02:31:38,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:31:38,406 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-03 02:31:38,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:31:38,412 INFO L225 Difference]: With dead ends: 197 [2022-11-03 02:31:38,412 INFO L226 Difference]: Without dead ends: 197 [2022-11-03 02:31:38,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:31:38,418 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 171 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:31:38,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 410 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:31:38,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-03 02:31:38,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 131. [2022-11-03 02:31:38,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 91 states have (on average 2.065934065934066) internal successors, (188), 130 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:38,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 188 transitions. [2022-11-03 02:31:38,442 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 188 transitions. Word has length 7 [2022-11-03 02:31:38,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:31:38,443 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 188 transitions. [2022-11-03 02:31:38,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:38,443 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 188 transitions. [2022-11-03 02:31:38,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 02:31:38,444 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:31:38,444 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:31:38,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:31:38,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:31:38,663 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:31:38,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:31:38,664 INFO L85 PathProgramCache]: Analyzing trace with hash -164566719, now seen corresponding path program 1 times [2022-11-03 02:31:38,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:31:38,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698516391] [2022-11-03 02:31:38,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:38,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:31:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:38,776 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-03 02:31:38,776 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:31:38,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698516391] [2022-11-03 02:31:38,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698516391] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:31:38,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:31:38,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:31:38,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101622307] [2022-11-03 02:31:38,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:31:38,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:31:38,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:31:38,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:31:38,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:31:38,779 INFO L87 Difference]: Start difference. First operand 131 states and 188 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:38,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:31:38,906 INFO L93 Difference]: Finished difference Result 190 states and 256 transitions. [2022-11-03 02:31:38,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:31:38,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-03 02:31:38,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:31:38,908 INFO L225 Difference]: With dead ends: 190 [2022-11-03 02:31:38,908 INFO L226 Difference]: Without dead ends: 190 [2022-11-03 02:31:38,909 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-03 02:31:38,913 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 87 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:31:38,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 127 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:31:38,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-03 02:31:38,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 129. [2022-11-03 02:31:38,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 91 states have (on average 2.0) internal successors, (182), 128 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:38,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 182 transitions. [2022-11-03 02:31:38,934 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 182 transitions. Word has length 8 [2022-11-03 02:31:38,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:31:38,934 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 182 transitions. [2022-11-03 02:31:38,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:38,935 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 182 transitions. [2022-11-03 02:31:38,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 02:31:38,935 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:31:38,935 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:31:38,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 02:31:38,936 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:31:38,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:31:38,936 INFO L85 PathProgramCache]: Analyzing trace with hash -164566718, now seen corresponding path program 1 times [2022-11-03 02:31:38,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:31:38,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130832161] [2022-11-03 02:31:38,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:38,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:31:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:39,118 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-03 02:31:39,118 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:31:39,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130832161] [2022-11-03 02:31:39,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130832161] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:31:39,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:31:39,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:31:39,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674509600] [2022-11-03 02:31:39,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:31:39,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:31:39,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:31:39,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:31:39,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:31:39,121 INFO L87 Difference]: Start difference. First operand 129 states and 182 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:39,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:31:39,357 INFO L93 Difference]: Finished difference Result 301 states and 386 transitions. [2022-11-03 02:31:39,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:31:39,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-03 02:31:39,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:31:39,359 INFO L225 Difference]: With dead ends: 301 [2022-11-03 02:31:39,359 INFO L226 Difference]: Without dead ends: 301 [2022-11-03 02:31:39,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:31:39,361 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 195 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:31:39,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 491 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:31:39,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-11-03 02:31:39,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 132. [2022-11-03 02:31:39,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 94 states have (on average 1.9680851063829787) internal successors, (185), 131 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:39,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 185 transitions. [2022-11-03 02:31:39,369 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 185 transitions. Word has length 8 [2022-11-03 02:31:39,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:31:39,369 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 185 transitions. [2022-11-03 02:31:39,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:39,370 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 185 transitions. [2022-11-03 02:31:39,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 02:31:39,370 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:31:39,370 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:31:39,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 02:31:39,371 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:31:39,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:31:39,372 INFO L85 PathProgramCache]: Analyzing trace with hash -806836785, now seen corresponding path program 1 times [2022-11-03 02:31:39,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:31:39,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164272554] [2022-11-03 02:31:39,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:39,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:31:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:39,415 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-03 02:31:39,416 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:31:39,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164272554] [2022-11-03 02:31:39,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164272554] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:31:39,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:31:39,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:31:39,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333641435] [2022-11-03 02:31:39,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:31:39,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:31:39,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:31:39,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:31:39,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:31:39,418 INFO L87 Difference]: Start difference. First operand 132 states and 185 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:39,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:31:39,521 INFO L93 Difference]: Finished difference Result 198 states and 262 transitions. [2022-11-03 02:31:39,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:31:39,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-03 02:31:39,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:31:39,522 INFO L225 Difference]: With dead ends: 198 [2022-11-03 02:31:39,522 INFO L226 Difference]: Without dead ends: 198 [2022-11-03 02:31:39,523 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-03 02:31:39,524 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 87 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:31:39,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 132 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:31:39,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-11-03 02:31:39,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 131. [2022-11-03 02:31:39,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 94 states have (on average 1.9361702127659575) internal successors, (182), 130 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:39,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 182 transitions. [2022-11-03 02:31:39,530 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 182 transitions. Word has length 9 [2022-11-03 02:31:39,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:31:39,530 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 182 transitions. [2022-11-03 02:31:39,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:39,531 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 182 transitions. [2022-11-03 02:31:39,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 02:31:39,531 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:31:39,531 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:31:39,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 02:31:39,532 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:31:39,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:31:39,533 INFO L85 PathProgramCache]: Analyzing trace with hash -806836784, now seen corresponding path program 1 times [2022-11-03 02:31:39,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:31:39,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87664164] [2022-11-03 02:31:39,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:39,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:31:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:39,591 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-03 02:31:39,591 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:31:39,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87664164] [2022-11-03 02:31:39,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87664164] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:31:39,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:31:39,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:31:39,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313661193] [2022-11-03 02:31:39,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:31:39,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:31:39,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:31:39,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:31:39,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:31:39,594 INFO L87 Difference]: Start difference. First operand 131 states and 182 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:39,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:31:39,694 INFO L93 Difference]: Finished difference Result 199 states and 260 transitions. [2022-11-03 02:31:39,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:31:39,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-03 02:31:39,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:31:39,696 INFO L225 Difference]: With dead ends: 199 [2022-11-03 02:31:39,696 INFO L226 Difference]: Without dead ends: 199 [2022-11-03 02:31:39,697 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-03 02:31:39,697 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 90 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:31:39,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 136 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:31:39,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-11-03 02:31:39,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 130. [2022-11-03 02:31:39,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 94 states have (on average 1.9042553191489362) internal successors, (179), 129 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:39,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 179 transitions. [2022-11-03 02:31:39,703 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 179 transitions. Word has length 9 [2022-11-03 02:31:39,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:31:39,703 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 179 transitions. [2022-11-03 02:31:39,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:39,704 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 179 transitions. [2022-11-03 02:31:39,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:31:39,704 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:31:39,704 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:31:39,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 02:31:39,705 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:31:39,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:31:39,706 INFO L85 PathProgramCache]: Analyzing trace with hash 2019147847, now seen corresponding path program 1 times [2022-11-03 02:31:39,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:31:39,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555144704] [2022-11-03 02:31:39,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:39,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:31:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:39,863 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-03 02:31:39,864 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:31:39,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555144704] [2022-11-03 02:31:39,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555144704] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:31:39,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973913390] [2022-11-03 02:31:39,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:39,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:31:39,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:31:39,867 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:31:39,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 02:31:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:39,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 02:31:39,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:31:40,019 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-03 02:31:40,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:31:40,089 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-03 02:31:40,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973913390] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:31:40,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [60819350] [2022-11-03 02:31:40,093 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-03 02:31:40,095 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:31:40,095 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:31:40,096 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:31:40,096 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:31:40,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:40,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:40,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:31:40,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:40,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:40,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:40,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:40,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:40,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-03 02:31:40,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:40,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:40,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:40,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:40,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:40,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:40,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:40,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:40,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:40,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-03 02:31:40,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:40,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-03 02:31:40,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:40,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:40,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-03 02:31:40,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:40,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 18 [2022-11-03 02:31:40,730 INFO L356 Elim1Store]: treesize reduction 138, result has 17.9 percent of original size [2022-11-03 02:31:40,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 397 treesize of output 405 [2022-11-03 02:31:41,295 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:31:41,297 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:31:41,339 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 02:31:41,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 424 treesize of output 422 [2022-11-03 02:31:41,391 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:31:41,393 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:31:41,431 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-03 02:31:41,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 444 treesize of output 442 [2022-11-03 02:31:41,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:41,477 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-11-03 02:31:41,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 488 treesize of output 471 [2022-11-03 02:31:41,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:31:41,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:31:41,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:31:41,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:31:41,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:31:41,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:31:41,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:31:41,813 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:31:43,348 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2391#(and (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) (<= 3 |ULTIMATE.start_sll_append_~sublist_length#1|) (< (select |#length| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 8)) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (<= 3 |ULTIMATE.start_node_create_with_sublist_~sublist_length#1|) (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 0 |ULTIMATE.start_sll_append_~head#1.offset|) (<= |ULTIMATE.start_node_create_with_sublist_#in~sublist_length#1| 3) (<= 0 |ULTIMATE.start_sll_append_~head#1.base|) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.offset|) (= 5 |ULTIMATE.start_main_~max~0#1|) (= |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_append_~sublist_length#1| 3) (= |ULTIMATE.start_main_~#head~1#1.offset| 0) (<= 3 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~#head~1#1.base|) (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.base|) (<= |ULTIMATE.start_sll_create_#in~len#1| 3) (<= |ULTIMATE.start_sll_append_#in~head#1.offset| 0) (= |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (= 3 |ULTIMATE.start_main_~min~0#1|) (<= |ULTIMATE.start_sll_append_#in~sublist_length#1| 3) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.offset| 0) (<= 3 |ULTIMATE.start_node_create_with_sublist_#in~sublist_length#1|) (<= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (<= 3 |ULTIMATE.start_sll_append_#in~sublist_length#1|) (<= |ULTIMATE.start_node_create_with_sublist_~sublist_length#1| 3) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-03 02:31:43,348 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:31:43,348 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:31:43,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-11-03 02:31:43,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629488657] [2022-11-03 02:31:43,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:31:43,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 02:31:43,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:31:43,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 02:31:43,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2022-11-03 02:31:43,350 INFO L87 Difference]: Start difference. First operand 130 states and 179 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:43,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:31:43,716 INFO L93 Difference]: Finished difference Result 309 states and 386 transitions. [2022-11-03 02:31:43,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:31:43,717 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 02:31:43,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:31:43,718 INFO L225 Difference]: With dead ends: 309 [2022-11-03 02:31:43,718 INFO L226 Difference]: Without dead ends: 309 [2022-11-03 02:31:43,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2022-11-03 02:31:43,719 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 193 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:31:43,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 800 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:31:43,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-11-03 02:31:43,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 148. [2022-11-03 02:31:43,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 112 states have (on average 1.7589285714285714) internal successors, (197), 147 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:43,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 197 transitions. [2022-11-03 02:31:43,725 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 197 transitions. Word has length 11 [2022-11-03 02:31:43,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:31:43,725 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 197 transitions. [2022-11-03 02:31:43,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:43,726 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 197 transitions. [2022-11-03 02:31:43,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 02:31:43,727 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:31:43,727 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1] [2022-11-03 02:31:43,766 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:31:43,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:31:43,928 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:31:43,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:31:43,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1990905420, now seen corresponding path program 2 times [2022-11-03 02:31:43,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:31:43,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595602560] [2022-11-03 02:31:43,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:43,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:31:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:44,019 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 02:31:44,019 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:31:44,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595602560] [2022-11-03 02:31:44,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595602560] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:31:44,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:31:44,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 02:31:44,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082691843] [2022-11-03 02:31:44,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:31:44,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:31:44,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:31:44,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:31:44,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:31:44,021 INFO L87 Difference]: Start difference. First operand 148 states and 197 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:44,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:31:44,129 INFO L93 Difference]: Finished difference Result 207 states and 269 transitions. [2022-11-03 02:31:44,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:31:44,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 02:31:44,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:31:44,133 INFO L225 Difference]: With dead ends: 207 [2022-11-03 02:31:44,133 INFO L226 Difference]: Without dead ends: 207 [2022-11-03 02:31:44,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-03 02:31:44,136 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 51 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:31:44,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 115 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:31:44,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-11-03 02:31:44,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 176. [2022-11-03 02:31:44,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 140 states have (on average 1.7357142857142858) internal successors, (243), 175 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:44,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 243 transitions. [2022-11-03 02:31:44,144 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 243 transitions. Word has length 15 [2022-11-03 02:31:44,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:31:44,145 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 243 transitions. [2022-11-03 02:31:44,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:44,145 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 243 transitions. [2022-11-03 02:31:44,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 02:31:44,146 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:31:44,146 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:31:44,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 02:31:44,147 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:31:44,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:31:44,148 INFO L85 PathProgramCache]: Analyzing trace with hash -279277977, now seen corresponding path program 2 times [2022-11-03 02:31:44,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:31:44,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525459491] [2022-11-03 02:31:44,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:44,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:31:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:44,478 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-03 02:31:44,478 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:31:44,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525459491] [2022-11-03 02:31:44,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525459491] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:31:44,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612453306] [2022-11-03 02:31:44,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:31:44,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:31:44,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:31:44,480 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:31:44,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 02:31:44,605 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 02:31:44,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:31:44,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-03 02:31:44,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:31:44,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:31:44,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:31:44,662 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:31:44,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 02:31:44,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 02:31:44,733 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:31:44,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 02:31:44,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 02:31:44,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:44,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:31:44,821 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-03 02:31:44,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:31:44,838 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:31:44,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:31:51,696 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:31:51,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612453306] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:31:51,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [565643445] [2022-11-03 02:31:51,699 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-03 02:31:51,699 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:31:51,700 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:31:51,700 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:31:51,700 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:31:51,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:51,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:51,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:31:51,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:51,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:51,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:51,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:51,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:51,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-03 02:31:51,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:51,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:51,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:51,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:51,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:51,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:51,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:51,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:51,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:51,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-03 02:31:51,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:51,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:51,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-03 02:31:51,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:51,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 18 [2022-11-03 02:31:51,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:51,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 18 [2022-11-03 02:31:52,272 INFO L356 Elim1Store]: treesize reduction 138, result has 17.9 percent of original size [2022-11-03 02:31:52,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 397 treesize of output 405 [2022-11-03 02:31:52,661 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:31:52,701 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 02:31:52,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 421 treesize of output 419 [2022-11-03 02:31:52,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:52,753 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-11-03 02:31:52,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 433 treesize of output 416 [2022-11-03 02:31:52,784 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:31:52,818 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 02:31:52,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 429 treesize of output 427 [2022-11-03 02:31:52,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:31:52,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:31:53,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:31:53,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:31:53,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:31:53,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:31:53,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:31:53,135 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:31:54,770 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3358#(and (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.offset|) (<= 3 |ULTIMATE.start_sll_append_~sublist_length#1|) (< (select |#length| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 8)) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (<= 3 |ULTIMATE.start_node_create_with_sublist_~sublist_length#1|) (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 0 |ULTIMATE.start_sll_append_~head#1.offset|) (<= |ULTIMATE.start_node_create_with_sublist_#in~sublist_length#1| 3) (<= 0 |ULTIMATE.start_sll_append_~head#1.base|) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.offset|) (= 5 |ULTIMATE.start_main_~max~0#1|) (= |ULTIMATE.start_node_create_with_sublist_#t~ret6#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_append_~sublist_length#1| 3) (= |ULTIMATE.start_main_~#head~1#1.offset| 0) (<= 3 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~#head~1#1.base|) (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.base|) (<= |ULTIMATE.start_sll_create_#in~len#1| 3) (<= |ULTIMATE.start_sll_append_#in~head#1.offset| 0) (= |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (= 3 |ULTIMATE.start_main_~min~0#1|) (<= |ULTIMATE.start_sll_append_#in~sublist_length#1| 3) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.offset| 0) (<= 3 |ULTIMATE.start_node_create_with_sublist_#in~sublist_length#1|) (<= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (<= 3 |ULTIMATE.start_sll_append_#in~sublist_length#1|) (<= |ULTIMATE.start_node_create_with_sublist_~sublist_length#1| 3) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-03 02:31:54,770 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:31:54,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:31:54,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-11-03 02:31:54,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567612686] [2022-11-03 02:31:54,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:31:54,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 02:31:54,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:31:54,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 02:31:54,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-11-03 02:31:54,772 INFO L87 Difference]: Start difference. First operand 176 states and 243 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:55,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:31:55,156 INFO L93 Difference]: Finished difference Result 230 states and 289 transitions. [2022-11-03 02:31:55,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:31:55,156 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 02:31:55,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:31:55,158 INFO L225 Difference]: With dead ends: 230 [2022-11-03 02:31:55,158 INFO L226 Difference]: Without dead ends: 230 [2022-11-03 02:31:55,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2022-11-03 02:31:55,159 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 113 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:31:55,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 417 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 336 Invalid, 0 Unknown, 212 Unchecked, 0.3s Time] [2022-11-03 02:31:55,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-11-03 02:31:55,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 174. [2022-11-03 02:31:55,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 140 states have (on average 1.6928571428571428) internal successors, (237), 173 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:55,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 237 transitions. [2022-11-03 02:31:55,164 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 237 transitions. Word has length 17 [2022-11-03 02:31:55,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:31:55,165 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 237 transitions. [2022-11-03 02:31:55,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:55,165 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 237 transitions. [2022-11-03 02:31:55,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 02:31:55,166 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:31:55,166 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2022-11-03 02:31:55,213 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:31:55,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 02:31:55,382 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:31:55,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:31:55,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1864429725, now seen corresponding path program 1 times [2022-11-03 02:31:55,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:31:55,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807828417] [2022-11-03 02:31:55,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:55,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:31:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:55,435 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 02:31:55,435 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:31:55,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807828417] [2022-11-03 02:31:55,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807828417] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:31:55,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:31:55,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:31:55,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20421448] [2022-11-03 02:31:55,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:31:55,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:31:55,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:31:55,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:31:55,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:31:55,438 INFO L87 Difference]: Start difference. First operand 174 states and 237 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:55,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:31:55,538 INFO L93 Difference]: Finished difference Result 201 states and 252 transitions. [2022-11-03 02:31:55,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:31:55,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-03 02:31:55,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:31:55,540 INFO L225 Difference]: With dead ends: 201 [2022-11-03 02:31:55,540 INFO L226 Difference]: Without dead ends: 201 [2022-11-03 02:31:55,540 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-03 02:31:55,541 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 87 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:31:55,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 173 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:31:55,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-11-03 02:31:55,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 163. [2022-11-03 02:31:55,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 129 states have (on average 1.6434108527131783) internal successors, (212), 162 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:55,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 212 transitions. [2022-11-03 02:31:55,545 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 212 transitions. Word has length 18 [2022-11-03 02:31:55,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:31:55,545 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 212 transitions. [2022-11-03 02:31:55,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:55,545 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 212 transitions. [2022-11-03 02:31:55,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:31:55,546 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:31:55,546 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:31:55,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 02:31:55,546 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:31:55,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:31:55,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1967460204, now seen corresponding path program 1 times [2022-11-03 02:31:55,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:31:55,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363079801] [2022-11-03 02:31:55,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:55,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:31:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:55,627 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 02:31:55,627 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:31:55,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363079801] [2022-11-03 02:31:55,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363079801] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:31:55,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:31:55,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:31:55,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71698121] [2022-11-03 02:31:55,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:31:55,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:31:55,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:31:55,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:31:55,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:31:55,630 INFO L87 Difference]: Start difference. First operand 163 states and 212 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:55,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:31:55,737 INFO L93 Difference]: Finished difference Result 179 states and 228 transitions. [2022-11-03 02:31:55,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:31:55,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 02:31:55,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:31:55,739 INFO L225 Difference]: With dead ends: 179 [2022-11-03 02:31:55,739 INFO L226 Difference]: Without dead ends: 179 [2022-11-03 02:31:55,739 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-03 02:31:55,740 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 7 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:31:55,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 189 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:31:55,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-11-03 02:31:55,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 164. [2022-11-03 02:31:55,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 130 states have (on average 1.6384615384615384) internal successors, (213), 163 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:55,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 213 transitions. [2022-11-03 02:31:55,744 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 213 transitions. Word has length 19 [2022-11-03 02:31:55,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:31:55,744 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 213 transitions. [2022-11-03 02:31:55,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:55,744 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 213 transitions. [2022-11-03 02:31:55,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:31:55,745 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:31:55,745 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:31:55,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 02:31:55,745 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:31:55,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:31:55,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1967462510, now seen corresponding path program 1 times [2022-11-03 02:31:55,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:31:55,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096898492] [2022-11-03 02:31:55,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:55,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:31:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:55,812 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 02:31:55,812 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:31:55,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096898492] [2022-11-03 02:31:55,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096898492] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:31:55,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:31:55,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:31:55,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356809372] [2022-11-03 02:31:55,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:31:55,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:31:55,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:31:55,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:31:55,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:31:55,814 INFO L87 Difference]: Start difference. First operand 164 states and 213 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:55,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:31:55,923 INFO L93 Difference]: Finished difference Result 165 states and 213 transitions. [2022-11-03 02:31:55,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:31:55,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 02:31:55,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:31:55,924 INFO L225 Difference]: With dead ends: 165 [2022-11-03 02:31:55,924 INFO L226 Difference]: Without dead ends: 160 [2022-11-03 02:31:55,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:31:55,925 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:31:55,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:31:55,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-03 02:31:55,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2022-11-03 02:31:55,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 124 states have (on average 1.6612903225806452) internal successors, (206), 157 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:55,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 206 transitions. [2022-11-03 02:31:55,929 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 206 transitions. Word has length 19 [2022-11-03 02:31:55,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:31:55,929 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 206 transitions. [2022-11-03 02:31:55,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:55,930 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 206 transitions. [2022-11-03 02:31:55,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:31:55,930 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:31:55,930 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:31:55,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 02:31:55,930 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:31:55,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:31:55,931 INFO L85 PathProgramCache]: Analyzing trace with hash -2097964542, now seen corresponding path program 1 times [2022-11-03 02:31:55,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:31:55,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380335031] [2022-11-03 02:31:55,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:55,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:31:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:55,998 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-03 02:31:55,998 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:31:55,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380335031] [2022-11-03 02:31:55,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380335031] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:31:55,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:31:55,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:31:55,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332959060] [2022-11-03 02:31:55,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:31:55,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:31:56,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:31:56,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:31:56,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:31:56,000 INFO L87 Difference]: Start difference. First operand 158 states and 206 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:56,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:31:56,101 INFO L93 Difference]: Finished difference Result 180 states and 228 transitions. [2022-11-03 02:31:56,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:31:56,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 02:31:56,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:31:56,103 INFO L225 Difference]: With dead ends: 180 [2022-11-03 02:31:56,103 INFO L226 Difference]: Without dead ends: 180 [2022-11-03 02:31:56,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:31:56,104 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 162 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:31:56,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 84 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:31:56,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-11-03 02:31:56,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 157. [2022-11-03 02:31:56,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 124 states have (on average 1.6370967741935485) internal successors, (203), 156 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:56,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 203 transitions. [2022-11-03 02:31:56,108 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 203 transitions. Word has length 19 [2022-11-03 02:31:56,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:31:56,108 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 203 transitions. [2022-11-03 02:31:56,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:56,109 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 203 transitions. [2022-11-03 02:31:56,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:31:56,109 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:31:56,110 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:31:56,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-03 02:31:56,110 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:31:56,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:31:56,111 INFO L85 PathProgramCache]: Analyzing trace with hash -2097964541, now seen corresponding path program 1 times [2022-11-03 02:31:56,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:31:56,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051717858] [2022-11-03 02:31:56,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:56,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:31:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:56,241 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-03 02:31:56,241 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:31:56,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051717858] [2022-11-03 02:31:56,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051717858] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:31:56,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:31:56,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:31:56,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838380420] [2022-11-03 02:31:56,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:31:56,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:31:56,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:31:56,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:31:56,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:31:56,244 INFO L87 Difference]: Start difference. First operand 157 states and 203 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:56,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:31:56,333 INFO L93 Difference]: Finished difference Result 156 states and 200 transitions. [2022-11-03 02:31:56,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:31:56,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 02:31:56,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:31:56,335 INFO L225 Difference]: With dead ends: 156 [2022-11-03 02:31:56,335 INFO L226 Difference]: Without dead ends: 156 [2022-11-03 02:31:56,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-03 02:31:56,336 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 169 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:31:56,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 63 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:31:56,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-03 02:31:56,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2022-11-03 02:31:56,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 124 states have (on average 1.6129032258064515) internal successors, (200), 155 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:56,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 200 transitions. [2022-11-03 02:31:56,340 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 200 transitions. Word has length 19 [2022-11-03 02:31:56,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:31:56,340 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 200 transitions. [2022-11-03 02:31:56,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:56,341 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 200 transitions. [2022-11-03 02:31:56,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 02:31:56,341 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:31:56,341 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:31:56,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-03 02:31:56,342 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:31:56,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:31:56,342 INFO L85 PathProgramCache]: Analyzing trace with hash -612391313, now seen corresponding path program 1 times [2022-11-03 02:31:56,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:31:56,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222188759] [2022-11-03 02:31:56,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:56,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:31:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:56,735 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-03 02:31:56,735 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:31:56,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222188759] [2022-11-03 02:31:56,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222188759] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:31:56,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58323665] [2022-11-03 02:31:56,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:56,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:31:56,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:31:56,737 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:31:56,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 02:31:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:56,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-03 02:31:56,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:31:56,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:31:56,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:56,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 02:31:56,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:56,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 02:31:56,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:56,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 02:31:57,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:57,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 02:31:57,038 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-03 02:31:57,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:31:59,208 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_append_~head#1.offset|) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_21| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_21| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_300 Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_20| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_20| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_301 Int)) (<= (+ |c_ULTIMATE.start_sll_append_~head#1.offset| 4) (select (store (store |c_#length| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_21| v_ArrVal_300) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_20| v_ArrVal_301) |c_ULTIMATE.start_sll_append_~head#1.base|)))))))) is different from false [2022-11-03 02:32:01,307 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_append_~head#1.offset|) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_22| Int)) (or (forall ((v_ArrVal_299 Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_21| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_21| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_300 Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_20| Int)) (or (forall ((v_ArrVal_301 Int)) (<= (+ |c_ULTIMATE.start_sll_append_~head#1.offset| 4) (select (store (store (store |c_#length| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_22| v_ArrVal_299) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_21| v_ArrVal_300) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_20| v_ArrVal_301) |c_ULTIMATE.start_sll_append_~head#1.base|))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_20| |c_#StackHeapBarrier|)))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_22| |c_#StackHeapBarrier|))))) is different from false [2022-11-03 02:32:03,443 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_main_~#head~1#1.offset|) (forall ((|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_20| Int)) (or (forall ((v_ArrVal_298 Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_22| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_299 Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_21| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_21| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_300 Int) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_20| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_20| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_301 Int)) (<= (+ 4 |c_ULTIMATE.start_main_~#head~1#1.offset|) (select (store (store (store (store |c_#length| |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_20| v_ArrVal_298) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_22| v_ArrVal_299) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_21| v_ArrVal_300) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_20| v_ArrVal_301) |c_ULTIMATE.start_main_~#head~1#1.base|))))))))) (not (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_20| |c_#StackHeapBarrier|))))) is different from false [2022-11-03 02:32:03,534 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-03 02:32:03,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58323665] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:32:03,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1516326534] [2022-11-03 02:32:03,537 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-03 02:32:03,537 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:32:03,537 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:32:03,537 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:32:03,538 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:32:03,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:03,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:03,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:32:03,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:03,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:03,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:03,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:03,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:03,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-03 02:32:03,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:03,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:03,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:03,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:03,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:03,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:03,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:03,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:03,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:03,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-03 02:32:03,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:03,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:03,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-03 02:32:03,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:03,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 18 [2022-11-03 02:32:03,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:03,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 18 [2022-11-03 02:32:04,075 INFO L356 Elim1Store]: treesize reduction 138, result has 17.9 percent of original size [2022-11-03 02:32:04,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 397 treesize of output 405 [2022-11-03 02:32:04,477 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:32:04,517 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 02:32:04,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 417 treesize of output 415 [2022-11-03 02:32:04,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:04,563 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-11-03 02:32:04,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 457 treesize of output 440 [2022-11-03 02:32:04,587 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:32:04,622 INFO L356 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2022-11-03 02:32:04,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 453 treesize of output 451 [2022-11-03 02:32:04,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:32:04,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:32:04,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:32:04,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:32:04,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:32:04,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:32:04,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:32:04,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:32:04,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:32:04,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:32:05,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:05,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:32:05,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:05,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:32:05,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:32:05,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:05,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-03 02:32:05,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:05,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-03 02:32:05,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:32:05,158 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:32:07,401 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5610#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0) (<= 3 |ULTIMATE.start_sll_append_~sublist_length#1|) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) (<= 3 |ULTIMATE.start_node_create_with_sublist_~sublist_length#1|) (= |ULTIMATE.start_sll_create_#res#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 0 |ULTIMATE.start_sll_append_~head#1.offset|) (< (select |#length| |ULTIMATE.start_sll_append_~head#1.base|) (+ |ULTIMATE.start_sll_append_~head#1.offset| 4)) (<= |ULTIMATE.start_node_create_with_sublist_#in~sublist_length#1| 3) (<= 0 |ULTIMATE.start_sll_append_~head#1.base|) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.offset|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.offset| |ULTIMATE.start_sll_append_~new_last~0#1.offset|) (= 5 |ULTIMATE.start_main_~max~0#1|) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_append_~sublist_length#1| 3) (= |ULTIMATE.start_main_~#head~1#1.offset| 0) (<= 3 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~#head~1#1.base|) (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.base|) (<= |ULTIMATE.start_sll_create_#in~len#1| 3) (<= |ULTIMATE.start_sll_append_#in~head#1.offset| 0) (= (select |#valid| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4)) |ULTIMATE.start_sll_create_#res#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0) (= |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (= 3 |ULTIMATE.start_main_~min~0#1|) (<= (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 8) (select |#length| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|)) (<= |ULTIMATE.start_sll_append_#in~sublist_length#1| 3) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.offset| 0) (<= 3 |ULTIMATE.start_node_create_with_sublist_#in~sublist_length#1|) (<= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (<= 3 |ULTIMATE.start_sll_append_#in~sublist_length#1|) (<= |ULTIMATE.start_node_create_with_sublist_~sublist_length#1| 3) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-03 02:32:07,401 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:32:07,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:32:07,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 5] total 9 [2022-11-03 02:32:07,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734088812] [2022-11-03 02:32:07,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:32:07,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 02:32:07,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:32:07,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 02:32:07,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=247, Unknown=3, NotChecked=102, Total=420 [2022-11-03 02:32:07,403 INFO L87 Difference]: Start difference. First operand 156 states and 200 transitions. Second operand has 11 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:32:09,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:32:09,702 INFO L93 Difference]: Finished difference Result 175 states and 217 transitions. [2022-11-03 02:32:09,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:32:09,707 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-03 02:32:09,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:32:09,708 INFO L225 Difference]: With dead ends: 175 [2022-11-03 02:32:09,708 INFO L226 Difference]: Without dead ends: 175 [2022-11-03 02:32:09,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=84, Invalid=305, Unknown=3, NotChecked=114, Total=506 [2022-11-03 02:32:09,709 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 355 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 284 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:32:09,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 58 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 95 Invalid, 0 Unknown, 284 Unchecked, 0.2s Time] [2022-11-03 02:32:09,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-11-03 02:32:09,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 152. [2022-11-03 02:32:09,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 124 states have (on average 1.5483870967741935) internal successors, (192), 151 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:32:09,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 192 transitions. [2022-11-03 02:32:09,712 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 192 transitions. Word has length 20 [2022-11-03 02:32:09,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:32:09,713 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 192 transitions. [2022-11-03 02:32:09,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:32:09,713 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 192 transitions. [2022-11-03 02:32:09,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 02:32:09,713 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:32:09,714 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:32:09,750 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 02:32:09,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-03 02:32:09,914 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:32:09,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:32:09,915 INFO L85 PathProgramCache]: Analyzing trace with hash -612391314, now seen corresponding path program 1 times [2022-11-03 02:32:09,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:32:09,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251974776] [2022-11-03 02:32:09,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:32:09,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:32:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:32:10,294 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-03 02:32:10,295 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:32:10,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251974776] [2022-11-03 02:32:10,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251974776] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:32:10,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153943993] [2022-11-03 02:32:10,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:32:10,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:32:10,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:32:10,296 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:32:10,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 02:32:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:32:10,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-03 02:32:10,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:32:10,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:32:10,487 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:32:10,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-03 02:32:10,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:10,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:32:10,559 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:32:10,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-03 02:32:10,631 INFO L356 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-11-03 02:32:10,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 38 [2022-11-03 02:32:10,737 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-03 02:32:10,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:32:10,979 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-03 02:32:10,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153943993] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:32:10,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1166150739] [2022-11-03 02:32:10,989 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-03 02:32:10,990 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:32:10,990 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:32:10,991 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:32:10,991 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:32:11,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:11,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:11,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:32:11,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:11,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:11,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:11,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:11,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:11,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-03 02:32:11,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:11,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:11,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:11,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:11,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:11,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:11,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:11,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:11,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:11,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-03 02:32:11,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:11,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:11,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-03 02:32:11,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:11,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 18 [2022-11-03 02:32:11,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:11,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 18 [2022-11-03 02:32:11,474 INFO L356 Elim1Store]: treesize reduction 138, result has 17.9 percent of original size [2022-11-03 02:32:11,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 397 treesize of output 405 [2022-11-03 02:32:11,809 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:32:11,851 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 02:32:11,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 421 treesize of output 419 [2022-11-03 02:32:11,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:11,893 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-11-03 02:32:11,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 465 treesize of output 448 [2022-11-03 02:32:11,915 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:32:11,949 INFO L356 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2022-11-03 02:32:11,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 461 treesize of output 459 [2022-11-03 02:32:12,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:32:12,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:32:12,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:32:12,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:32:12,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:32:12,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:32:12,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:32:12,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:32:12,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:32:12,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:32:12,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:12,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:32:12,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:12,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:32:12,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:32:12,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:32:12,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:12,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-03 02:32:12,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:12,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-03 02:32:12,510 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:32:14,768 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6085#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0) (<= 3 |ULTIMATE.start_sll_append_~sublist_length#1|) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) (<= 3 |ULTIMATE.start_node_create_with_sublist_~sublist_length#1|) (= |ULTIMATE.start_sll_create_#res#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 0 |ULTIMATE.start_sll_append_~head#1.offset|) (<= |ULTIMATE.start_node_create_with_sublist_#in~sublist_length#1| 3) (<= 0 |ULTIMATE.start_sll_append_~head#1.base|) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.offset|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.offset| |ULTIMATE.start_sll_append_~new_last~0#1.offset|) (= 5 |ULTIMATE.start_main_~max~0#1|) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_append_~sublist_length#1| 3) (= |ULTIMATE.start_main_~#head~1#1.offset| 0) (<= 3 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~#head~1#1.base|) (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.base|) (<= |ULTIMATE.start_sll_create_#in~len#1| 3) (<= |ULTIMATE.start_sll_append_#in~head#1.offset| 0) (= (select |#valid| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4)) |ULTIMATE.start_sll_create_#res#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0) (= |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (= 3 |ULTIMATE.start_main_~min~0#1|) (<= (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 8) (select |#length| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|)) (<= |ULTIMATE.start_sll_append_#in~sublist_length#1| 3) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.offset| 0) (<= 3 |ULTIMATE.start_node_create_with_sublist_#in~sublist_length#1|) (<= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (<= 3 |ULTIMATE.start_sll_append_#in~sublist_length#1|) (not (= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1)) (<= |ULTIMATE.start_node_create_with_sublist_~sublist_length#1| 3) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-03 02:32:14,768 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:32:14,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:32:14,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 12 [2022-11-03 02:32:14,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405479895] [2022-11-03 02:32:14,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:32:14,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 02:32:14,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:32:14,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 02:32:14,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2022-11-03 02:32:14,770 INFO L87 Difference]: Start difference. First operand 152 states and 192 transitions. Second operand has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:32:14,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:32:14,947 INFO L93 Difference]: Finished difference Result 173 states and 211 transitions. [2022-11-03 02:32:14,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:32:14,947 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-03 02:32:14,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:32:14,948 INFO L225 Difference]: With dead ends: 173 [2022-11-03 02:32:14,948 INFO L226 Difference]: Without dead ends: 173 [2022-11-03 02:32:14,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2022-11-03 02:32:14,950 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 448 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:32:14,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 129 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 45 Unchecked, 0.1s Time] [2022-11-03 02:32:14,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-11-03 02:32:14,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 150. [2022-11-03 02:32:14,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 124 states have (on average 1.5) internal successors, (186), 149 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:32:14,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 186 transitions. [2022-11-03 02:32:14,954 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 186 transitions. Word has length 20 [2022-11-03 02:32:14,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:32:14,954 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 186 transitions. [2022-11-03 02:32:14,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:32:14,955 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 186 transitions. [2022-11-03 02:32:14,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 02:32:14,955 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:32:14,955 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:32:14,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 02:32:15,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 02:32:15,167 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:32:15,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:32:15,168 INFO L85 PathProgramCache]: Analyzing trace with hash -97352723, now seen corresponding path program 1 times [2022-11-03 02:32:15,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:32:15,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892963224] [2022-11-03 02:32:15,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:32:15,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:32:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:32:15,712 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-03 02:32:15,713 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:32:15,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892963224] [2022-11-03 02:32:15,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892963224] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:32:15,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804725057] [2022-11-03 02:32:15,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:32:15,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:32:15,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:32:15,714 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:32:15,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 02:32:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:32:15,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-03 02:32:15,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:32:16,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:16,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:32:16,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:16,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:32:16,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:16,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:32:16,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:16,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:32:16,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:16,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:32:16,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:16,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 02:32:16,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:16,347 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-03 02:32:16,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 34 [2022-11-03 02:32:16,385 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:32:16,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 20 [2022-11-03 02:32:16,480 INFO L356 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-03 02:32:16,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 37 treesize of output 50 [2022-11-03 02:32:16,519 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:32:16,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 24 [2022-11-03 02:32:16,619 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 02:32:16,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 26 [2022-11-03 02:32:16,647 INFO L356 Elim1Store]: treesize reduction 32, result has 41.8 percent of original size [2022-11-03 02:32:16,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 42 treesize of output 52 [2022-11-03 02:32:16,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:32:16,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:16,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2022-11-03 02:32:16,845 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:32:16,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:32:16,898 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:32:16,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2022-11-03 02:32:16,908 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:32:16,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2022-11-03 02:32:16,984 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))) is different from false [2022-11-03 02:32:17,015 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_495 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_495) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (not (= (select v_arrayElimArr_2 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0))))) is different from false [2022-11-03 02:32:17,064 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (not (= (select v_arrayElimArr_2 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0)))))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_495 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0)) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| v_ArrVal_495) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))))) is different from false [2022-11-03 02:32:17,102 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| Int) (v_ArrVal_493 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_495 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_493) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| v_ArrVal_495) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| Int) (v_ArrVal_494 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_494))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (not (= (select v_arrayElimArr_2 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0))))))) is different from false [2022-11-03 02:32:17,184 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| Int) (v_ArrVal_494 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| v_ArrVal_494))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31|) 0 0))) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (not (= (select v_arrayElimArr_2 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0)))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| Int) (v_ArrVal_493 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_495 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| v_ArrVal_493) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| v_ArrVal_495) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| |c_#StackHeapBarrier|))))) is different from false [2022-11-03 02:32:17,242 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_491 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| Int) (v_ArrVal_493 (Array Int Int))) (or (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_495 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0)) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_491) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| v_ArrVal_493) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| v_ArrVal_495) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_492 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| Int) (v_ArrVal_494 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int))) (or (= (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| v_ArrVal_494))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31|) 0 0))) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (not (= (select v_arrayElimArr_2 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0)))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| |c_#StackHeapBarrier|))))) is different from false [2022-11-03 02:32:17,357 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_491 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| Int) (v_ArrVal_493 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_495 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0)) (= 0 (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_491) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| v_ArrVal_493) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| v_ArrVal_495) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| |c_#StackHeapBarrier|)))))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_492 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| Int) (v_ArrVal_494 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0)) (= (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| v_ArrVal_494))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31|) 0 0))) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| |c_#StackHeapBarrier|))))))) is different from false [2022-11-03 02:32:17,580 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_492 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| Int) (v_ArrVal_494 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 0) 0)) (= (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| v_ArrVal_494))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31|) 0 0))) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| |c_#StackHeapBarrier|)))))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_491 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| Int) (v_ArrVal_493 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_495 (Array Int Int))) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_491) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| v_ArrVal_493) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| v_ArrVal_495) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (not (= (select v_arrayElimArr_1 0) 0)))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| |c_#StackHeapBarrier|))))))) is different from false [2022-11-03 02:32:17,710 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-03 02:32:17,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804725057] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:32:17,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2065946674] [2022-11-03 02:32:17,713 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-03 02:32:17,713 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:32:17,713 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:32:17,713 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:32:17,714 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:32:17,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:17,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:17,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:32:17,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:17,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:17,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:17,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:17,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:17,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-03 02:32:17,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:17,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:17,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:17,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:17,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:17,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:17,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:17,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:17,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:17,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-03 02:32:17,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:17,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:17,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-03 02:32:17,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:17,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 18 [2022-11-03 02:32:17,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:17,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 18 [2022-11-03 02:32:18,192 INFO L356 Elim1Store]: treesize reduction 138, result has 17.9 percent of original size [2022-11-03 02:32:18,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 397 treesize of output 405 [2022-11-03 02:32:18,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:18,550 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-11-03 02:32:18,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 425 treesize of output 408 [2022-11-03 02:32:18,575 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:32:18,576 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:32:18,614 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 02:32:18,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 421 treesize of output 419 [2022-11-03 02:32:18,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:32:18,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:32:18,688 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-03 02:32:18,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 437 treesize of output 435 [2022-11-03 02:32:18,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:32:18,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:32:18,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:32:18,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:32:18,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:32:18,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:32:18,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:32:18,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:32:18,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:32:18,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:32:19,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:19,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:32:19,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:32:19,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:19,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:32:19,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:32:19,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:19,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-03 02:32:19,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:19,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-03 02:32:19,232 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:32:22,846 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6580#(and (<= (+ |ULTIMATE.start_sll_append_~head#1.offset| 4) (select |#length| |ULTIMATE.start_sll_append_~head#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|) |ULTIMATE.start_sll_append_~temp~0#1.base|) (not (= (select |#valid| |ULTIMATE.start_sll_append_~temp~0#1.base|) 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0) (<= 3 |ULTIMATE.start_sll_append_~sublist_length#1|) (= |ULTIMATE.start_sll_append_~temp~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|)) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) (<= 3 |ULTIMATE.start_node_create_with_sublist_~sublist_length#1|) (= |ULTIMATE.start_sll_create_#res#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 0 |ULTIMATE.start_sll_append_~head#1.offset|) (<= |ULTIMATE.start_node_create_with_sublist_#in~sublist_length#1| 3) (<= 0 |ULTIMATE.start_sll_append_~head#1.base|) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.offset|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.offset| |ULTIMATE.start_sll_append_~new_last~0#1.offset|) (= 5 |ULTIMATE.start_main_~max~0#1|) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_append_~sublist_length#1| 3) (= |ULTIMATE.start_main_~#head~1#1.offset| 0) (or (not (= |ULTIMATE.start_sll_append_~temp~0#1.base| 0)) (not (= |ULTIMATE.start_sll_append_~temp~0#1.offset| 0))) (<= 3 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~#head~1#1.base|) (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.base|) (<= |ULTIMATE.start_sll_create_#in~len#1| 3) (<= |ULTIMATE.start_sll_append_#in~head#1.offset| 0) (= (select |#valid| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4)) |ULTIMATE.start_sll_create_#res#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0) (= |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (= 3 |ULTIMATE.start_main_~min~0#1|) (<= (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 8) (select |#length| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|)) (<= |ULTIMATE.start_sll_append_#in~sublist_length#1| 3) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.offset| 0) (<= 3 |ULTIMATE.start_node_create_with_sublist_#in~sublist_length#1|) (<= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (<= 3 |ULTIMATE.start_sll_append_#in~sublist_length#1|) (<= |ULTIMATE.start_node_create_with_sublist_~sublist_length#1| 3) (<= 0 |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1) (= |ULTIMATE.start_node_create_with_sublist_#res#1.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-03 02:32:22,846 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:32:22,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:32:22,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2022-11-03 02:32:22,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834413745] [2022-11-03 02:32:22,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:32:22,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-03 02:32:22,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:32:22,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-03 02:32:22,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=973, Unknown=17, NotChecked=568, Total=1722 [2022-11-03 02:32:22,849 INFO L87 Difference]: Start difference. First operand 150 states and 186 transitions. Second operand has 30 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 29 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:32:24,868 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_492 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| Int) (v_ArrVal_494 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 0) 0)) (= (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| v_ArrVal_494))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31|) 0 0))) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| |c_#StackHeapBarrier|)))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_491 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| Int) (v_ArrVal_493 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_495 (Array Int Int))) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_491) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| v_ArrVal_493) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| v_ArrVal_495) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (not (= (select v_arrayElimArr_1 0) 0)))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| |c_#StackHeapBarrier|)))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#head~1#1.base|)) is different from false [2022-11-03 02:32:26,875 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|))) (and (= (select .cse0 0) 0) (not (= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|)) (= (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_sll_append_~head#1.base|) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_491 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| Int) (v_ArrVal_493 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_495 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0)) (= 0 (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_491) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| v_ArrVal_493) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| v_ArrVal_495) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| |c_#StackHeapBarrier|)))))) (= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (= (select .cse1 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= (select .cse1 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_492 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| Int) (v_ArrVal_494 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0)) (= (select (select (store (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_33| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| v_ArrVal_494))) (store .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| (store (select .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31|) 0 0))) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| |c_#StackHeapBarrier|)))))))) is different from false [2022-11-03 02:32:28,700 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|))) (and (= (select .cse0 0) 0) (forall ((v_ArrVal_491 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| Int) (v_ArrVal_493 (Array Int Int))) (or (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_495 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0)) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_491) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| v_ArrVal_493) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| v_ArrVal_495) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| |c_#StackHeapBarrier|)))) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|)) (= (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_sll_append_~head#1.base|) (= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|)) (= (select .cse1 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (forall ((v_ArrVal_492 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| Int) (v_ArrVal_494 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int))) (or (= (select (select (store (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| v_ArrVal_494))) (store .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| (store (select .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31|) 0 0))) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (not (= (select v_arrayElimArr_2 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0)))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| |c_#StackHeapBarrier|)))) (= (select .cse1 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|))) is different from false [2022-11-03 02:32:28,712 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|))) (and (= (select .cse0 0) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| Int) (v_ArrVal_494 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int))) (or (= (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| v_ArrVal_494))) (store .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| (store (select .cse1 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31|) 0 0))) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (not (= (select v_arrayElimArr_2 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0)))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| |c_#StackHeapBarrier|)))) (not (= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|)) (= (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_sll_append_~head#1.base|) (= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| Int) (v_ArrVal_493 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_495 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| v_ArrVal_493) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| v_ArrVal_495) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_32| |c_#StackHeapBarrier|)))) (= (select .cse2 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= (select .cse2 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2022-11-03 02:32:28,718 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|))) (and (= (select .cse0 0) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| Int) (v_ArrVal_493 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_495 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_493) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| v_ArrVal_495) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|)) (= (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_sll_append_~head#1.base|) (<= (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 2) |c_ULTIMATE.start_sll_append_~head#1.base|) (= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|)) (= (select .cse1 0) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| Int) (v_ArrVal_494 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int))) (or (= (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_494))) (store .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| (store (select .cse2 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31|) 0 |c_ULTIMATE.start_sll_create_~new_head~0#1.offset|))) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (not (= (select v_arrayElimArr_2 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0)))))) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= (select .cse1 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2022-11-03 02:32:30,723 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|))) (and (= (select .cse0 0) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (not (= (select v_arrayElimArr_2 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0)))))) (not (= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|)) (= (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_sll_append_~head#1.base|) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| |c_#StackHeapBarrier|)) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_495 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0)) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_31| v_ArrVal_495) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (= (select .cse1 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= (select .cse1 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (and (<= (+ 2 |ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0) 0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2022-11-03 02:32:30,798 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|))) (and (= (select .cse0 0) 0) (not (= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|)) (= (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_sll_append_~head#1.base|) (= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (= (select .cse1 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (= (select .cse1 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (and (<= (+ 2 |ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0) 0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2022-11-03 02:32:30,803 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|))) (and (= (select .cse0 0) 0) (not (= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|)) (= (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (= (select .cse1 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int))) (or (not (= (select v_arrayElimArr_2 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (forall ((|ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| Int) (v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (= (select .cse1 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (and (<= (+ 2 |ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0) 0))))) is different from false [2022-11-03 02:32:31,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:32:31,080 INFO L93 Difference]: Finished difference Result 173 states and 210 transitions. [2022-11-03 02:32:31,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 02:32:31,080 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 29 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-03 02:32:31,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:32:31,081 INFO L225 Difference]: With dead ends: 173 [2022-11-03 02:32:31,081 INFO L226 Difference]: Without dead ends: 173 [2022-11-03 02:32:31,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=208, Invalid=1161, Unknown=27, NotChecked=1360, Total=2756 [2022-11-03 02:32:31,083 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 3 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 271 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:32:31,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 750 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 271 Unchecked, 0.1s Time] [2022-11-03 02:32:31,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-11-03 02:32:31,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 167. [2022-11-03 02:32:31,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 141 states have (on average 1.446808510638298) internal successors, (204), 166 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:32:31,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 204 transitions. [2022-11-03 02:32:31,087 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 204 transitions. Word has length 22 [2022-11-03 02:32:31,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:32:31,087 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 204 transitions. [2022-11-03 02:32:31,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 29 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:32:31,088 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 204 transitions. [2022-11-03 02:32:31,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 02:32:31,088 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:32:31,088 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:32:31,128 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 02:32:31,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 02:32:31,315 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:32:31,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:32:31,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1739646879, now seen corresponding path program 1 times [2022-11-03 02:32:31,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:32:31,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878609920] [2022-11-03 02:32:31,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:32:31,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:32:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:32:31,491 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:32:31,492 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:32:31,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878609920] [2022-11-03 02:32:31,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878609920] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:32:31,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386551225] [2022-11-03 02:32:31,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:32:31,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:32:31,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:32:31,495 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:32:31,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 02:32:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:32:31,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-03 02:32:31,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:32:31,663 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:32:31,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:32:31,729 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:32:31,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386551225] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:32:31,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1857287433] [2022-11-03 02:32:31,731 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-03 02:32:31,732 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:32:31,732 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:32:31,732 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:32:31,732 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:32:31,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:31,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:31,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:32:31,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:32:31,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:32:32,029 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:32:32,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:32:32,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:32:32,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:32:32,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:32:32,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:32:32,202 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-03 02:32:32,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 205 treesize of output 210 [2022-11-03 02:32:32,268 INFO L356 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-11-03 02:32:32,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 case distinctions, treesize of input 206 treesize of output 223 [2022-11-03 02:32:32,616 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:32:32,633 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:32:32,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 292 treesize of output 291 [2022-11-03 02:32:32,657 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:32:32,676 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-03 02:32:32,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 316 treesize of output 315 [2022-11-03 02:32:32,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:32:32,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:32:32,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:32:32,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:32:32,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:32:32,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:32:32,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:32:32,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:32:32,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:32:32,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:32:32,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:32:33,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:32:33,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:33,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:32:33,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:33,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:32:33,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:33,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-03 02:32:33,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:33,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-03 02:32:33,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:32:33,179 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:32:35,816 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7114#(and (<= (+ |ULTIMATE.start_sll_append_~head#1.offset| 4) (select |#length| |ULTIMATE.start_sll_append_~head#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|) |ULTIMATE.start_sll_append_~temp~0#1.base|) (not (= (select |#valid| |ULTIMATE.start_sll_append_~temp~0#1.base|) 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0) (<= 3 |ULTIMATE.start_sll_append_~sublist_length#1|) (= |ULTIMATE.start_sll_append_~temp~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|)) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) (<= 3 |ULTIMATE.start_node_create_with_sublist_~sublist_length#1|) (= |ULTIMATE.start_sll_create_#res#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= 0 |ULTIMATE.start_sll_append_~head#1.offset|) (<= 0 |ULTIMATE.start_sll_append_~head#1.base|) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.offset|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.offset| |ULTIMATE.start_sll_append_~new_last~0#1.offset|) (= 5 |ULTIMATE.start_main_~max~0#1|) (<= |ULTIMATE.start_sll_create_~len#1| 0) (= |ULTIMATE.start_main_~#head~1#1.offset| 0) (or (not (= |ULTIMATE.start_sll_append_~temp~0#1.base| 0)) (not (= |ULTIMATE.start_sll_append_~temp~0#1.offset| 0))) (<= 3 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~#head~1#1.base|) (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.base|) (<= |ULTIMATE.start_sll_append_#in~head#1.offset| 0) (= (select |#valid| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4)) |ULTIMATE.start_sll_create_#res#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0) (= |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (= 3 |ULTIMATE.start_main_~min~0#1|) (<= (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 8) (select |#length| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|)) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.offset| 0) (<= 3 |ULTIMATE.start_node_create_with_sublist_#in~sublist_length#1|) (<= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (<= 3 |ULTIMATE.start_sll_append_#in~sublist_length#1|) (<= 0 |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1) (= |ULTIMATE.start_node_create_with_sublist_#res#1.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-03 02:32:35,817 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:32:35,817 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:32:35,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2022-11-03 02:32:35,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129560838] [2022-11-03 02:32:35,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:32:35,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 02:32:35,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:32:35,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 02:32:35,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2022-11-03 02:32:35,819 INFO L87 Difference]: Start difference. First operand 167 states and 204 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:32:36,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:32:36,242 INFO L93 Difference]: Finished difference Result 336 states and 392 transitions. [2022-11-03 02:32:36,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 02:32:36,243 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-03 02:32:36,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:32:36,244 INFO L225 Difference]: With dead ends: 336 [2022-11-03 02:32:36,244 INFO L226 Difference]: Without dead ends: 336 [2022-11-03 02:32:36,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2022-11-03 02:32:36,245 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 260 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:32:36,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 836 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:32:36,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-11-03 02:32:36,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 186. [2022-11-03 02:32:36,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 160 states have (on average 1.475) internal successors, (236), 185 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:32:36,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 236 transitions. [2022-11-03 02:32:36,250 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 236 transitions. Word has length 26 [2022-11-03 02:32:36,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:32:36,251 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 236 transitions. [2022-11-03 02:32:36,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:32:36,251 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 236 transitions. [2022-11-03 02:32:36,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 02:32:36,252 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:32:36,252 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:32:36,290 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 02:32:36,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:32:36,471 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:32:36,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:32:36,471 INFO L85 PathProgramCache]: Analyzing trace with hash -2064394944, now seen corresponding path program 2 times [2022-11-03 02:32:36,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:32:36,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797315640] [2022-11-03 02:32:36,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:32:36,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:32:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:32:37,174 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 02:32:37,174 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:32:37,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797315640] [2022-11-03 02:32:37,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797315640] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:32:37,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637924308] [2022-11-03 02:32:37,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:32:37,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:32:37,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:32:37,179 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:32:37,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 02:32:37,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-03 02:32:37,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:32:37,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-03 02:32:37,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:32:37,696 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:32:37,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2022-11-03 02:32:37,713 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:32:37,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2022-11-03 02:32:37,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:37,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:32:37,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:37,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:32:37,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:37,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:32:37,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:37,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:32:37,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:37,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:32:37,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:37,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:32:38,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:38,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:32:38,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:38,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:32:38,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:38,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:32:38,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:38,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:32:38,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:38,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:32:38,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:38,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:32:38,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:32:38,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:32:38,133 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 02:32:38,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:32:38,150 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_721 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| v_ArrVal_721) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_720 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~new_last~0#1.base| v_ArrVal_720) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) is different from false [2022-11-03 02:32:38,179 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|) (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_719) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_720) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))) (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_718) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_721) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-11-03 02:32:38,227 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_714 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_714) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_718) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_721) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))) (forall ((v_ArrVal_715 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|) (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_715) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_719) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_720) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-11-03 02:32:40,269 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_715 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|) (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| v_ArrVal_715) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_719) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_720) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_714 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| v_ArrVal_714) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_718) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_721) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))))) is different from false [2022-11-03 02:32:40,314 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_713 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_714 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_713) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| v_ArrVal_714) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_718) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_721) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))))) (forall ((v_ArrVal_712 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((v_ArrVal_715 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_712) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| v_ArrVal_715) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_719) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_720) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|))))) is different from false [2022-11-03 02:32:42,398 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_712 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((v_ArrVal_715 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|) (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| v_ArrVal_712) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| v_ArrVal_715) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_719) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_720) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)))))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| Int)) (or (forall ((v_ArrVal_713 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((v_ArrVal_714 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| v_ArrVal_713) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| v_ArrVal_714) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_718) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_721) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|))))) is different from false [2022-11-03 02:32:44,455 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_710 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_713 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_714 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_710) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| v_ArrVal_713) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| v_ArrVal_714) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_718) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_721) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))))))) (forall ((v_ArrVal_711 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_712 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((v_ArrVal_715 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|) (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_711) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| v_ArrVal_712) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| v_ArrVal_715) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_719) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_720) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|))))))) is different from false [2022-11-03 02:32:46,567 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_710 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| Int)) (or (forall ((v_ArrVal_713 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_714 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| v_ArrVal_710) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| v_ArrVal_713) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| v_ArrVal_714) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_718) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_721) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)))))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_711 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_712 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_715 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| v_ArrVal_711) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| v_ArrVal_712) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| v_ArrVal_715) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_719) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_720) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|)))))))))) is different from false [2022-11-03 02:32:48,657 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| Int) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_711 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| Int)) (or (forall ((v_ArrVal_712 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((v_ArrVal_715 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|) (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| v_ArrVal_711) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| v_ArrVal_712) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| v_ArrVal_715) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_719) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_720) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| Int) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_710 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_713 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((v_ArrVal_714 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| v_ArrVal_710) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| v_ArrVal_713) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| v_ArrVal_714) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_718) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_721) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|))))) is different from false [2022-11-03 02:32:50,829 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| Int) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_711 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| Int)) (or (forall ((v_ArrVal_712 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_715 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|) (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| v_ArrVal_711) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| v_ArrVal_712) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| v_ArrVal_715) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_719) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_720) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| Int) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_710 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| Int)) (or (forall ((v_ArrVal_713 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((v_ArrVal_714 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| v_ArrVal_710) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| v_ArrVal_713) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| v_ArrVal_714) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_718) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_721) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|))))))) is different from false [2022-11-03 02:32:52,911 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| Int) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_711 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| Int)) (or (forall ((v_ArrVal_712 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_715 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0 0)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| v_ArrVal_711) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| v_ArrVal_712) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| v_ArrVal_715) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_719) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_720) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)))))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| Int) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_710 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| Int)) (or (forall ((v_ArrVal_713 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_714 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0 0)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| v_ArrVal_710) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| v_ArrVal_713) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| v_ArrVal_714) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_718) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_721) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|))))))) is different from false [2022-11-03 02:32:55,065 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_24| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| Int) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_710 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| Int)) (or (forall ((v_ArrVal_713 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((v_ArrVal_714 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0 0)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| v_ArrVal_710) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| v_ArrVal_713) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| v_ArrVal_714) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_24| v_ArrVal_718) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_721) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_24| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)))))) (not (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_24| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_24| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| Int) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_711 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_712 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_715 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0 0)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| v_ArrVal_711) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| v_ArrVal_712) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| v_ArrVal_715) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_24| v_ArrVal_719) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_720) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_24| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|))))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_24| |c_#StackHeapBarrier|))))) is different from false [2022-11-03 02:32:55,647 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 22 not checked. [2022-11-03 02:32:55,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637924308] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:32:55,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [773954795] [2022-11-03 02:32:55,649 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-03 02:32:55,649 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:32:55,649 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:32:55,649 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:32:55,649 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:32:55,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:55,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:55,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:32:55,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:32:55,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:32:55,924 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:32:55,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:32:55,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:32:55,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:32:55,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:32:55,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:32:56,095 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-03 02:32:56,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 205 treesize of output 210 [2022-11-03 02:32:56,165 INFO L356 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-11-03 02:32:56,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 case distinctions, treesize of input 206 treesize of output 223 [2022-11-03 02:32:56,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:32:56,339 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:32:56,359 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:32:56,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 203 treesize of output 202 [2022-11-03 02:32:56,381 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:32:56,396 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-03 02:32:56,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 219 treesize of output 218 [2022-11-03 02:32:56,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:32:56,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:32:56,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:32:56,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:32:56,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:32:56,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:32:56,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:32:56,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:32:56,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:32:56,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:32:56,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:32:56,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:56,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:32:56,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:56,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:32:56,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:56,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-03 02:32:56,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:32:56,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:56,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-03 02:32:56,839 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:32:59,631 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7859#(and (<= (+ |ULTIMATE.start_sll_append_~head#1.offset| 4) (select |#length| |ULTIMATE.start_sll_append_~head#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|) |ULTIMATE.start_sll_append_~temp~0#1.base|) (not (= (select |#valid| |ULTIMATE.start_sll_append_~temp~0#1.base|) 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0) (<= 3 |ULTIMATE.start_sll_append_~sublist_length#1|) (= |ULTIMATE.start_sll_append_~temp~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~head#1.base|) |ULTIMATE.start_sll_append_~head#1.offset|)) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) (<= 3 |ULTIMATE.start_node_create_with_sublist_~sublist_length#1|) (= |ULTIMATE.start_sll_create_#res#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= 0 |ULTIMATE.start_sll_append_~head#1.offset|) (<= 0 |ULTIMATE.start_sll_append_~head#1.base|) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.offset|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.offset| |ULTIMATE.start_sll_append_~new_last~0#1.offset|) (= 5 |ULTIMATE.start_main_~max~0#1|) (<= |ULTIMATE.start_sll_create_~len#1| 0) (= |ULTIMATE.start_main_~#head~1#1.offset| 0) (or (not (= |ULTIMATE.start_sll_append_~temp~0#1.base| 0)) (not (= |ULTIMATE.start_sll_append_~temp~0#1.offset| 0))) (<= 3 |ULTIMATE.start_sll_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~#head~1#1.base|) (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_sll_append_#in~head#1.base|) (<= |ULTIMATE.start_sll_append_#in~head#1.offset| 0) (= (select |#valid| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 4)) |ULTIMATE.start_sll_create_#res#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset|) 0) (= |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 0) (= 3 |ULTIMATE.start_main_~min~0#1|) (<= (+ |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.offset| 8) (select |#length| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|)) (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.offset| 0) (<= 3 |ULTIMATE.start_node_create_with_sublist_#in~sublist_length#1|) (<= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (<= 3 |ULTIMATE.start_sll_append_#in~sublist_length#1|) (<= 0 |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_sll_append_~head#1.base|) 1) (= |ULTIMATE.start_node_create_with_sublist_#res#1.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) (= |ULTIMATE.start_node_create_with_sublist_#res#1.base| |ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-03 02:32:59,631 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:32:59,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:32:59,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 15] total 30 [2022-11-03 02:32:59,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291697345] [2022-11-03 02:32:59,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:32:59,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 02:32:59,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:32:59,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 02:32:59,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=807, Unknown=12, NotChecked=828, Total=1806 [2022-11-03 02:32:59,633 INFO L87 Difference]: Start difference. First operand 186 states and 236 transitions. Second operand has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 30 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:33:01,658 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (forall ((|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_24| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| Int) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_710 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| Int)) (or (forall ((v_ArrVal_713 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((v_ArrVal_714 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0 0)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| v_ArrVal_710) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| v_ArrVal_713) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| v_ArrVal_714) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_24| v_ArrVal_718) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_721) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_24| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)))))) (not (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_24| |c_#StackHeapBarrier|)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (forall ((|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_24| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| Int) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_711 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_712 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_715 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0 0)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| v_ArrVal_711) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| v_ArrVal_712) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| v_ArrVal_715) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_24| v_ArrVal_719) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_720) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_24| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|))))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_24| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#head~1#1.base|)) is different from false [2022-11-03 02:33:03,671 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| Int) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_711 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| Int)) (or (forall ((v_ArrVal_712 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_715 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0 0)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| v_ArrVal_711) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| v_ArrVal_712) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| v_ArrVal_715) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_719) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_720) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| Int) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_710 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| Int)) (or (forall ((v_ArrVal_713 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_714 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0 0)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| v_ArrVal_710) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| v_ArrVal_713) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| v_ArrVal_714) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_718) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_721) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|))))))) is different from false [2022-11-03 02:33:05,678 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| Int) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_711 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| Int)) (or (forall ((v_ArrVal_712 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_715 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|) (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| v_ArrVal_711) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| v_ArrVal_712) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| v_ArrVal_715) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_719) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_720) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| Int) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_710 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| Int)) (or (forall ((v_ArrVal_713 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((v_ArrVal_714 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| v_ArrVal_710) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| v_ArrVal_713) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| v_ArrVal_714) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_718) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_721) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)))))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.base| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-11-03 02:33:07,685 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|)) (= (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_sll_append_~head#1.base|) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_append_~head#1.base|)) (= (select .cse1 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (= (select .cse1 |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| Int) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_711 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| Int)) (or (forall ((v_ArrVal_712 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((v_ArrVal_715 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|) (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| v_ArrVal_711) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| v_ArrVal_712) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| v_ArrVal_715) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_719) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_720) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.base| 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| Int) (|ULTIMATE.start_sll_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_710 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_713 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((v_ArrVal_714 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| v_ArrVal_710) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| v_ArrVal_713) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| v_ArrVal_714) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_718) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_721) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2022-11-03 02:33:09,692 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_710 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| Int)) (or (forall ((v_ArrVal_713 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_714 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| v_ArrVal_710) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| v_ArrVal_713) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| v_ArrVal_714) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_718) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_721) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_711 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_712 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_715 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_43| v_ArrVal_711) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| v_ArrVal_712) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| v_ArrVal_715) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_719) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_720) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|))))))))) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2022-11-03 02:33:11,788 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_append_~head#1.offset| 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_append_~head#1.base|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_712 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((v_ArrVal_715 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|) (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| v_ArrVal_712) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| v_ArrVal_715) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_719) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_720) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)))))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| Int)) (or (forall ((v_ArrVal_713 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| Int)) (or (forall ((v_ArrVal_714 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20|) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| v_ArrVal_713) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| v_ArrVal_714) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_718) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_20| v_ArrVal_721) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_41| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_42| |c_#StackHeapBarrier|))))) is different from false [2022-11-03 02:33:12,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:12,133 INFO L93 Difference]: Finished difference Result 308 states and 385 transitions. [2022-11-03 02:33:12,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 02:33:12,134 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 30 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-03 02:33:12,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:12,136 INFO L225 Difference]: With dead ends: 308 [2022-11-03 02:33:12,136 INFO L226 Difference]: Without dead ends: 308 [2022-11-03 02:33:12,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 31.4s TimeCoverageRelationStatistics Valid=189, Invalid=921, Unknown=18, NotChecked=1422, Total=2550 [2022-11-03 02:33:12,137 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 73 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 1413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1116 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:12,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1029 Invalid, 1413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 283 Invalid, 0 Unknown, 1116 Unchecked, 0.3s Time] [2022-11-03 02:33:12,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-11-03 02:33:12,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 226. [2022-11-03 02:33:12,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 200 states have (on average 1.39) internal successors, (278), 225 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:33:12,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 278 transitions. [2022-11-03 02:33:12,145 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 278 transitions. Word has length 29 [2022-11-03 02:33:12,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:12,145 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 278 transitions. [2022-11-03 02:33:12,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 30 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:33:12,146 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 278 transitions. [2022-11-03 02:33:12,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-03 02:33:12,146 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:12,146 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:12,187 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 02:33:12,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:33:12,375 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:33:12,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:12,375 INFO L85 PathProgramCache]: Analyzing trace with hash 701135266, now seen corresponding path program 1 times [2022-11-03 02:33:12,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:12,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540430360] [2022-11-03 02:33:12,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:12,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:12,485 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-03 02:33:12,485 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:12,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540430360] [2022-11-03 02:33:12,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540430360] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:33:12,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:33:12,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:33:12,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925804452] [2022-11-03 02:33:12,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:33:12,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:33:12,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:12,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:33:12,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:33:12,487 INFO L87 Difference]: Start difference. First operand 226 states and 278 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:33:12,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:12,592 INFO L93 Difference]: Finished difference Result 276 states and 326 transitions. [2022-11-03 02:33:12,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:33:12,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-03 02:33:12,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:12,594 INFO L225 Difference]: With dead ends: 276 [2022-11-03 02:33:12,594 INFO L226 Difference]: Without dead ends: 276 [2022-11-03 02:33:12,594 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-03 02:33:12,595 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 203 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:12,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 100 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:33:12,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-11-03 02:33:12,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 224. [2022-11-03 02:33:12,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 198 states have (on average 1.3838383838383839) internal successors, (274), 223 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:33:12,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 274 transitions. [2022-11-03 02:33:12,601 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 274 transitions. Word has length 39 [2022-11-03 02:33:12,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:12,602 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 274 transitions. [2022-11-03 02:33:12,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:33:12,602 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 274 transitions. [2022-11-03 02:33:12,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-03 02:33:12,603 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:12,603 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:12,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-03 02:33:12,603 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:33:12,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:12,603 INFO L85 PathProgramCache]: Analyzing trace with hash 265070343, now seen corresponding path program 1 times [2022-11-03 02:33:12,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:12,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592296774] [2022-11-03 02:33:12,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:12,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:12,757 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-03 02:33:12,757 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:12,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592296774] [2022-11-03 02:33:12,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592296774] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:33:12,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:33:12,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:33:12,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491067232] [2022-11-03 02:33:12,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:33:12,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:33:12,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:12,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:33:12,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:33:12,760 INFO L87 Difference]: Start difference. First operand 224 states and 274 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:33:12,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:12,918 INFO L93 Difference]: Finished difference Result 261 states and 329 transitions. [2022-11-03 02:33:12,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:33:12,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-03 02:33:12,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:12,921 INFO L225 Difference]: With dead ends: 261 [2022-11-03 02:33:12,921 INFO L226 Difference]: Without dead ends: 261 [2022-11-03 02:33:12,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:33:12,922 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 38 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:12,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 200 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:33:12,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-11-03 02:33:12,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 251. [2022-11-03 02:33:12,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 225 states have (on average 1.431111111111111) internal successors, (322), 250 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:33:12,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 322 transitions. [2022-11-03 02:33:12,928 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 322 transitions. Word has length 40 [2022-11-03 02:33:12,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:12,928 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 322 transitions. [2022-11-03 02:33:12,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:33:12,929 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 322 transitions. [2022-11-03 02:33:12,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-03 02:33:12,930 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:12,930 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:12,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-03 02:33:12,931 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:33:12,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:12,931 INFO L85 PathProgramCache]: Analyzing trace with hash 265072649, now seen corresponding path program 1 times [2022-11-03 02:33:12,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:12,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100545346] [2022-11-03 02:33:12,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:12,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:13,143 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-03 02:33:13,143 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:13,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100545346] [2022-11-03 02:33:13,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100545346] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:33:13,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:33:13,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:33:13,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870398089] [2022-11-03 02:33:13,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:33:13,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:33:13,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:13,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:33:13,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:33:13,145 INFO L87 Difference]: Start difference. First operand 251 states and 322 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:33:13,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:13,328 INFO L93 Difference]: Finished difference Result 374 states and 482 transitions. [2022-11-03 02:33:13,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:33:13,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-03 02:33:13,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:13,331 INFO L225 Difference]: With dead ends: 374 [2022-11-03 02:33:13,331 INFO L226 Difference]: Without dead ends: 374 [2022-11-03 02:33:13,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:33:13,332 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 401 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:13,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 189 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:33:13,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-11-03 02:33:13,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 290. [2022-11-03 02:33:13,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 264 states have (on average 1.4431818181818181) internal successors, (381), 289 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:33:13,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 381 transitions. [2022-11-03 02:33:13,340 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 381 transitions. Word has length 40 [2022-11-03 02:33:13,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:13,340 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 381 transitions. [2022-11-03 02:33:13,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:33:13,341 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 381 transitions. [2022-11-03 02:33:13,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-03 02:33:13,341 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:13,341 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:13,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-03 02:33:13,342 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:33:13,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:13,342 INFO L85 PathProgramCache]: Analyzing trace with hash 260355583, now seen corresponding path program 1 times [2022-11-03 02:33:13,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:13,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212268591] [2022-11-03 02:33:13,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:13,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:13,609 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-03 02:33:13,609 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:13,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212268591] [2022-11-03 02:33:13,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212268591] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:33:13,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:33:13,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:33:13,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18001676] [2022-11-03 02:33:13,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:33:13,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:33:13,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:13,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:33:13,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:33:13,613 INFO L87 Difference]: Start difference. First operand 290 states and 381 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:33:13,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:13,917 INFO L93 Difference]: Finished difference Result 455 states and 576 transitions. [2022-11-03 02:33:13,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:33:13,918 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-03 02:33:13,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:13,919 INFO L225 Difference]: With dead ends: 455 [2022-11-03 02:33:13,920 INFO L226 Difference]: Without dead ends: 455 [2022-11-03 02:33:13,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:33:13,920 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 417 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:13,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 197 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:33:13,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-11-03 02:33:13,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 297. [2022-11-03 02:33:13,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 272 states have (on average 1.4375) internal successors, (391), 296 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:33:13,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 391 transitions. [2022-11-03 02:33:13,945 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 391 transitions. Word has length 40 [2022-11-03 02:33:13,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:13,946 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 391 transitions. [2022-11-03 02:33:13,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:33:13,946 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 391 transitions. [2022-11-03 02:33:13,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-03 02:33:13,947 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:13,947 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:13,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-03 02:33:13,947 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:33:13,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:13,948 INFO L85 PathProgramCache]: Analyzing trace with hash 260355584, now seen corresponding path program 1 times [2022-11-03 02:33:13,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:13,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350138848] [2022-11-03 02:33:13,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:13,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:14,352 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-03 02:33:14,353 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:14,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350138848] [2022-11-03 02:33:14,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350138848] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:33:14,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:33:14,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:33:14,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139338241] [2022-11-03 02:33:14,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:33:14,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:33:14,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:14,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:33:14,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:33:14,355 INFO L87 Difference]: Start difference. First operand 297 states and 391 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:33:14,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:14,597 INFO L93 Difference]: Finished difference Result 380 states and 492 transitions. [2022-11-03 02:33:14,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:33:14,598 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-03 02:33:14,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:14,600 INFO L225 Difference]: With dead ends: 380 [2022-11-03 02:33:14,600 INFO L226 Difference]: Without dead ends: 380 [2022-11-03 02:33:14,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:33:14,601 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 382 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:14,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 160 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:33:14,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-11-03 02:33:14,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 299. [2022-11-03 02:33:14,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 274 states have (on average 1.427007299270073) internal successors, (391), 298 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:33:14,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 391 transitions. [2022-11-03 02:33:14,608 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 391 transitions. Word has length 40 [2022-11-03 02:33:14,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:14,608 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 391 transitions. [2022-11-03 02:33:14,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:33:14,609 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 391 transitions. [2022-11-03 02:33:14,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-03 02:33:14,610 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:14,610 INFO L195 NwaCegarLoop]: trace histogram [4, 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-03 02:33:14,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-03 02:33:14,610 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:33:14,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:14,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1093730647, now seen corresponding path program 1 times [2022-11-03 02:33:14,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:14,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220891836] [2022-11-03 02:33:14,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:14,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:15,428 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-03 02:33:15,428 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:15,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220891836] [2022-11-03 02:33:15,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220891836] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:33:15,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412004328] [2022-11-03 02:33:15,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:15,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:33:15,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:33:15,431 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:33:15,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c9454a-1d59-47f6-8d78-f76fc2dd6949/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 02:33:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:15,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-03 02:33:15,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:33:15,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:33:15,682 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:33:15,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-03 02:33:15,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:33:15,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-03 02:33:16,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:33:16,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:33:16,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:33:16,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 02:33:16,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 02:33:16,545 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:33:16,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:16,552 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-11-03 02:33:16,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 42 [2022-11-03 02:33:16,560 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:33:16,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 15 [2022-11-03 02:33:16,566 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-03 02:33:16,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:33:17,014 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:33:17,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1424 treesize of output 1405 [2022-11-03 02:45:56,661 WARN L234 SmtUtils]: Spent 12.47m on a formula simplification. DAG size of input: 171 DAG size of output: 130 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)