./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 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/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_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-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-38b53e6 [2022-11-25 23:18:46,877 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:18:46,879 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:18:46,902 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:18:46,902 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:18:46,903 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:18:46,905 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:18:46,906 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:18:46,908 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:18:46,909 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:18:46,910 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:18:46,911 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:18:46,912 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:18:46,913 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:18:46,914 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:18:46,915 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:18:46,916 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:18:46,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:18:46,919 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:18:46,921 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:18:46,922 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:18:46,931 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:18:46,932 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:18:46,933 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:18:46,937 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:18:46,937 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:18:46,937 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:18:46,938 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:18:46,939 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:18:46,940 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:18:46,940 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:18:46,941 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:18:46,947 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:18:46,949 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:18:46,950 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:18:46,950 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:18:46,951 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:18:46,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:18:46,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:18:46,952 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:18:46,953 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:18:46,956 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-25 23:18:46,999 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:18:46,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:18:47,000 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:18:47,000 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:18:47,001 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:18:47,001 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:18:47,001 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:18:47,001 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:18:47,002 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:18:47,002 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:18:47,011 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:18:47,011 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:18:47,011 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:18:47,012 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:18:47,012 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:18:47,012 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:18:47,012 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:18:47,012 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:18:47,013 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 23:18:47,013 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 23:18:47,014 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:18:47,014 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:18:47,014 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:18:47,015 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:18:47,015 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:18:47,015 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:18:47,015 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 23:18:47,015 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 23:18:47,016 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 23:18:47,016 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:18:47,016 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 23:18:47,016 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:18:47,017 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:18:47,017 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:18:47,017 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:18:47,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:18:47,018 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:18:47,018 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:18:47,018 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:18:47,018 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:18:47,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:18:47,019 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:18:47,019 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_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-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-25 23:18:47,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:18:47,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:18:47,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:18:47,302 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:18:47,303 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:18:47,305 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i [2022-11-25 23:18:50,370 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:18:50,650 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:18:50,667 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i [2022-11-25 23:18:50,685 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/data/9e2da41f9/384e3f5835d5455fa4f93ae14e5910b8/FLAG69f27571f [2022-11-25 23:18:50,700 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/data/9e2da41f9/384e3f5835d5455fa4f93ae14e5910b8 [2022-11-25 23:18:50,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:18:50,705 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:18:50,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:18:50,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:18:50,715 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:18:50,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:18:50" (1/1) ... [2022-11-25 23:18:50,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48339f91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:18:50, skipping insertion in model container [2022-11-25 23:18:50,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:18:50" (1/1) ... [2022-11-25 23:18:50,726 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:18:50,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:18:51,129 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i[24987,25000] [2022-11-25 23:18:51,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:18:51,146 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:18:51,184 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i[24987,25000] [2022-11-25 23:18:51,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:18:51,210 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:18:51,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:18:51 WrapperNode [2022-11-25 23:18:51,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:18:51,211 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:18:51,212 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:18:51,212 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:18:51,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:18:51" (1/1) ... [2022-11-25 23:18:51,248 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:18:51" (1/1) ... [2022-11-25 23:18:51,283 INFO L138 Inliner]: procedures = 129, calls = 39, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 185 [2022-11-25 23:18:51,286 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:18:51,287 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:18:51,288 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:18:51,288 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:18:51,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:18:51" (1/1) ... [2022-11-25 23:18:51,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:18:51" (1/1) ... [2022-11-25 23:18:51,301 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:18:51" (1/1) ... [2022-11-25 23:18:51,301 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:18:51" (1/1) ... [2022-11-25 23:18:51,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:18:51" (1/1) ... [2022-11-25 23:18:51,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:18:51" (1/1) ... [2022-11-25 23:18:51,323 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:18:51" (1/1) ... [2022-11-25 23:18:51,325 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:18:51" (1/1) ... [2022-11-25 23:18:51,330 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:18:51,331 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:18:51,331 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:18:51,331 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:18:51,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:18:51" (1/1) ... [2022-11-25 23:18:51,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:18:51,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:18:51,371 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:18:51,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:18:51,428 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-25 23:18:51,429 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-25 23:18:51,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 23:18:51,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:18:51,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 23:18:51,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 23:18:51,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 23:18:51,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:18:51,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 23:18:51,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:18:51,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:18:51,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:18:51,577 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:18:51,592 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:18:51,651 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-25 23:18:52,187 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:18:52,310 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:18:52,310 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-11-25 23:18:52,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:18:52 BoogieIcfgContainer [2022-11-25 23:18:52,314 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:18:52,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:18:52,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:18:52,321 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:18:52,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:18:50" (1/3) ... [2022-11-25 23:18:52,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa35623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:18:52, skipping insertion in model container [2022-11-25 23:18:52,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:18:51" (2/3) ... [2022-11-25 23:18:52,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa35623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:18:52, skipping insertion in model container [2022-11-25 23:18:52,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:18:52" (3/3) ... [2022-11-25 23:18:52,326 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-1.i [2022-11-25 23:18:52,346 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:18:52,347 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2022-11-25 23:18:52,393 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:18:52,400 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;@468d1f99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:18:52,400 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2022-11-25 23:18:52,405 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-25 23:18:52,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 23:18:52,410 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:18:52,411 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 23:18:52,412 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-25 23:18:52,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:18:52,418 INFO L85 PathProgramCache]: Analyzing trace with hash 295585, now seen corresponding path program 1 times [2022-11-25 23:18:52,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:18:52,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100297712] [2022-11-25 23:18:52,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:18:52,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:18:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:18:52,686 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-25 23:18:52,687 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:18:52,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100297712] [2022-11-25 23:18:52,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100297712] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:18:52,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:18:52,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:18:52,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018281042] [2022-11-25 23:18:52,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:18:52,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:18:52,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:18:52,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:18:52,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:18:52,741 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-25 23:18:52,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:18:52,943 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2022-11-25 23:18:52,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:18:52,953 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-25 23:18:52,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:18:52,961 INFO L225 Difference]: With dead ends: 115 [2022-11-25 23:18:52,961 INFO L226 Difference]: Without dead ends: 110 [2022-11-25 23:18:52,963 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-25 23:18:52,966 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 93 mSDsluCounter, 15 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.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:18:52,967 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.1s Time] [2022-11-25 23:18:52,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-25 23:18:53,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 87. [2022-11-25 23:18:53,014 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-25 23:18:53,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2022-11-25 23:18:53,021 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 3 [2022-11-25 23:18:53,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:18:53,022 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2022-11-25 23:18:53,022 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-25 23:18:53,022 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2022-11-25 23:18:53,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 23:18:53,023 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:18:53,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 23:18:53,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:18:53,024 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-25 23:18:53,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:18:53,024 INFO L85 PathProgramCache]: Analyzing trace with hash 295586, now seen corresponding path program 1 times [2022-11-25 23:18:53,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:18:53,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660759045] [2022-11-25 23:18:53,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:18:53,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:18:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:18:53,104 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-25 23:18:53,105 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:18:53,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660759045] [2022-11-25 23:18:53,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660759045] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:18:53,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:18:53,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:18:53,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796469509] [2022-11-25 23:18:53,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:18:53,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:18:53,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:18:53,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:18:53,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:18:53,110 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-25 23:18:53,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:18:53,241 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2022-11-25 23:18:53,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:18:53,241 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-25 23:18:53,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:18:53,243 INFO L225 Difference]: With dead ends: 125 [2022-11-25 23:18:53,243 INFO L226 Difference]: Without dead ends: 125 [2022-11-25 23:18:53,243 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-25 23:18:53,244 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 41 mSDsluCounter, 64 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-25 23:18:53,245 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-25 23:18:53,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-25 23:18:53,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 88. [2022-11-25 23:18:53,252 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-25 23:18:53,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2022-11-25 23:18:53,254 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 3 [2022-11-25 23:18:53,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:18:53,254 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2022-11-25 23:18:53,254 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-25 23:18:53,254 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2022-11-25 23:18:53,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 23:18:53,255 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:18:53,255 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:18:53,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:18:53,255 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-25 23:18:53,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:18:53,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1113659344, now seen corresponding path program 1 times [2022-11-25 23:18:53,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:18:53,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043349368] [2022-11-25 23:18:53,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:18:53,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:18:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:18:53,351 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-25 23:18:53,351 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:18:53,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043349368] [2022-11-25 23:18:53,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043349368] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:18:53,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560706228] [2022-11-25 23:18:53,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:18:53,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:18:53,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:18:53,358 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:18:53,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:18:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:18:53,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:18:53,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:18:53,523 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-25 23:18:53,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:18:53,556 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-25 23:18:53,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560706228] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:18:53,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [356206448] [2022-11-25 23:18:53,580 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-25 23:18:53,580 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:18:53,597 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:18:53,604 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:18:53,604 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:18:53,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:18:53,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:18:53,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 23:18:54,218 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:18:54,579 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-25 23:18:54,579 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:18:54,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:18:54,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-11-25 23:18:54,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419472620] [2022-11-25 23:18:54,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:18:54,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 23:18:54,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:18:54,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 23:18:54,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-11-25 23:18:54,582 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-25 23:18:54,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:18:54,813 INFO L93 Difference]: Finished difference Result 197 states and 218 transitions. [2022-11-25 23:18:54,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:18:54,813 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-25 23:18:54,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:18:54,815 INFO L225 Difference]: With dead ends: 197 [2022-11-25 23:18:54,815 INFO L226 Difference]: Without dead ends: 197 [2022-11-25 23:18:54,815 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-25 23:18:54,816 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 168 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:18:54,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 410 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:18:54,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-25 23:18:54,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 131. [2022-11-25 23:18:54,825 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-25 23:18:54,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 188 transitions. [2022-11-25 23:18:54,827 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 188 transitions. Word has length 7 [2022-11-25 23:18:54,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:18:54,827 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 188 transitions. [2022-11-25 23:18:54,827 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-25 23:18:54,827 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 188 transitions. [2022-11-25 23:18:54,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 23:18:54,828 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:18:54,828 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:18:54,838 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 23:18:55,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:18:55,039 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-25 23:18:55,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:18:55,039 INFO L85 PathProgramCache]: Analyzing trace with hash -164566719, now seen corresponding path program 1 times [2022-11-25 23:18:55,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:18:55,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887104533] [2022-11-25 23:18:55,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:18:55,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:18:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:18:55,138 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-25 23:18:55,138 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:18:55,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887104533] [2022-11-25 23:18:55,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887104533] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:18:55,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:18:55,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:18:55,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58478073] [2022-11-25 23:18:55,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:18:55,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:18:55,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:18:55,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:18:55,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:18:55,141 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-25 23:18:55,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:18:55,254 INFO L93 Difference]: Finished difference Result 190 states and 256 transitions. [2022-11-25 23:18:55,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:18:55,254 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-25 23:18:55,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:18:55,256 INFO L225 Difference]: With dead ends: 190 [2022-11-25 23:18:55,256 INFO L226 Difference]: Without dead ends: 190 [2022-11-25 23:18:55,256 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-25 23:18:55,257 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 87 mSDsluCounter, 34 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-25 23:18:55,257 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-25 23:18:55,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-25 23:18:55,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 129. [2022-11-25 23:18:55,265 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-25 23:18:55,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 182 transitions. [2022-11-25 23:18:55,266 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 182 transitions. Word has length 8 [2022-11-25 23:18:55,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:18:55,267 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 182 transitions. [2022-11-25 23:18:55,267 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-25 23:18:55,267 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 182 transitions. [2022-11-25 23:18:55,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 23:18:55,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:18:55,268 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:18:55,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 23:18:55,269 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-25 23:18:55,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:18:55,269 INFO L85 PathProgramCache]: Analyzing trace with hash -164566718, now seen corresponding path program 1 times [2022-11-25 23:18:55,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:18:55,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310227718] [2022-11-25 23:18:55,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:18:55,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:18:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:18:55,401 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-25 23:18:55,401 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:18:55,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310227718] [2022-11-25 23:18:55,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310227718] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:18:55,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:18:55,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:18:55,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370814202] [2022-11-25 23:18:55,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:18:55,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:18:55,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:18:55,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:18:55,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:18:55,404 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-25 23:18:55,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:18:55,661 INFO L93 Difference]: Finished difference Result 301 states and 386 transitions. [2022-11-25 23:18:55,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:18:55,662 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-25 23:18:55,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:18:55,663 INFO L225 Difference]: With dead ends: 301 [2022-11-25 23:18:55,663 INFO L226 Difference]: Without dead ends: 301 [2022-11-25 23:18:55,663 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-25 23:18:55,664 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 198 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:18:55,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 491 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:18:55,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-11-25 23:18:55,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 132. [2022-11-25 23:18:55,672 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-25 23:18:55,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 185 transitions. [2022-11-25 23:18:55,673 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 185 transitions. Word has length 8 [2022-11-25 23:18:55,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:18:55,673 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 185 transitions. [2022-11-25 23:18:55,673 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-25 23:18:55,674 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 185 transitions. [2022-11-25 23:18:55,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 23:18:55,674 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:18:55,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:18:55,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 23:18:55,675 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-25 23:18:55,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:18:55,675 INFO L85 PathProgramCache]: Analyzing trace with hash -806836785, now seen corresponding path program 1 times [2022-11-25 23:18:55,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:18:55,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957957230] [2022-11-25 23:18:55,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:18:55,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:18:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:18:55,723 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-25 23:18:55,723 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:18:55,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957957230] [2022-11-25 23:18:55,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957957230] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:18:55,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:18:55,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:18:55,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158633480] [2022-11-25 23:18:55,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:18:55,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:18:55,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:18:55,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:18:55,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:18:55,726 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-25 23:18:55,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:18:55,833 INFO L93 Difference]: Finished difference Result 198 states and 262 transitions. [2022-11-25 23:18:55,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:18:55,835 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-25 23:18:55,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:18:55,837 INFO L225 Difference]: With dead ends: 198 [2022-11-25 23:18:55,837 INFO L226 Difference]: Without dead ends: 198 [2022-11-25 23:18:55,837 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-25 23:18:55,841 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 87 mSDsluCounter, 35 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-25 23:18:55,842 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-25 23:18:55,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-11-25 23:18:55,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 131. [2022-11-25 23:18:55,870 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-25 23:18:55,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 182 transitions. [2022-11-25 23:18:55,871 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 182 transitions. Word has length 9 [2022-11-25 23:18:55,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:18:55,871 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 182 transitions. [2022-11-25 23:18:55,871 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-25 23:18:55,871 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 182 transitions. [2022-11-25 23:18:55,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 23:18:55,872 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:18:55,872 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:18:55,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 23:18:55,872 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-25 23:18:55,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:18:55,873 INFO L85 PathProgramCache]: Analyzing trace with hash -806836784, now seen corresponding path program 1 times [2022-11-25 23:18:55,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:18:55,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273418330] [2022-11-25 23:18:55,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:18:55,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:18:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:18:56,010 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-25 23:18:56,012 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:18:56,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273418330] [2022-11-25 23:18:56,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273418330] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:18:56,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:18:56,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:18:56,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065024508] [2022-11-25 23:18:56,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:18:56,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:18:56,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:18:56,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:18:56,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:18:56,015 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-25 23:18:56,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:18:56,118 INFO L93 Difference]: Finished difference Result 199 states and 260 transitions. [2022-11-25 23:18:56,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:18:56,119 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-25 23:18:56,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:18:56,120 INFO L225 Difference]: With dead ends: 199 [2022-11-25 23:18:56,120 INFO L226 Difference]: Without dead ends: 199 [2022-11-25 23:18:56,120 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-25 23:18:56,121 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 90 mSDsluCounter, 38 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-25 23:18:56,121 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-25 23:18:56,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-11-25 23:18:56,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 130. [2022-11-25 23:18:56,125 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-25 23:18:56,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 179 transitions. [2022-11-25 23:18:56,126 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 179 transitions. Word has length 9 [2022-11-25 23:18:56,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:18:56,126 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 179 transitions. [2022-11-25 23:18:56,126 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-25 23:18:56,127 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 179 transitions. [2022-11-25 23:18:56,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 23:18:56,127 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:18:56,127 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:18:56,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 23:18:56,128 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-25 23:18:56,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:18:56,128 INFO L85 PathProgramCache]: Analyzing trace with hash 2019147847, now seen corresponding path program 1 times [2022-11-25 23:18:56,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:18:56,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892804157] [2022-11-25 23:18:56,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:18:56,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:18:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:18:56,250 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-25 23:18:56,250 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:18:56,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892804157] [2022-11-25 23:18:56,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892804157] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:18:56,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393211191] [2022-11-25 23:18:56,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:18:56,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:18:56,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:18:56,253 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:18:56,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 23:18:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:18:56,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 23:18:56,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:18:56,397 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-25 23:18:56,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:18:56,454 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-25 23:18:56,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393211191] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:18:56,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1353657083] [2022-11-25 23:18:56,459 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-25 23:18:56,459 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:18:56,460 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:18:56,460 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:18:56,460 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:18:56,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:18:56,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:18:56,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 23:18:56,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:18:56,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:18:56,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:18:56,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:18:56,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:18:56,566 INFO L350 Elim1Store]: Elim1 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-25 23:18:56,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:18:56,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:18:56,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:18:56,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:18:56,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:18:56,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:18:56,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:18:56,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:18:56,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:18:56,662 INFO L350 Elim1Store]: Elim1 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-25 23:18:56,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:18:56,766 INFO L350 Elim1Store]: Elim1 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-25 23:18:56,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:18:56,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:18:56,797 INFO L350 Elim1Store]: Elim1 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-25 23:18:56,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:18:56,820 INFO L350 Elim1Store]: Elim1 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-25 23:18:57,112 INFO L321 Elim1Store]: treesize reduction 138, result has 17.9 percent of original size [2022-11-25 23:18:57,113 INFO L350 Elim1Store]: Elim1 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-25 23:18:57,707 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:18:57,709 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:18:57,743 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-25 23:18:57,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 424 treesize of output 422 [2022-11-25 23:18:57,788 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:18:57,789 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:18:57,820 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-25 23:18:57,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 444 treesize of output 442 [2022-11-25 23:18:57,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:18:57,890 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-11-25 23:18:57,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 488 treesize of output 471 [2022-11-25 23:18:58,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:18:58,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:18:58,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:18:58,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:18:58,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:18:58,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:18:58,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:18:58,253 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:18:59,827 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-25 23:18:59,827 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:18:59,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:18:59,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-11-25 23:18:59,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524981077] [2022-11-25 23:18:59,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:18:59,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 23:18:59,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:18:59,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 23:18:59,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2022-11-25 23:18:59,829 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-25 23:19:00,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:19:00,171 INFO L93 Difference]: Finished difference Result 309 states and 386 transitions. [2022-11-25 23:19:00,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 23:19:00,172 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-25 23:19:00,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:19:00,173 INFO L225 Difference]: With dead ends: 309 [2022-11-25 23:19:00,173 INFO L226 Difference]: Without dead ends: 309 [2022-11-25 23:19:00,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2022-11-25 23:19:00,174 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 196 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:19:00,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 800 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:19:00,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-11-25 23:19:00,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 148. [2022-11-25 23:19:00,178 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-25 23:19:00,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 197 transitions. [2022-11-25 23:19:00,179 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 197 transitions. Word has length 11 [2022-11-25 23:19:00,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:19:00,179 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 197 transitions. [2022-11-25 23:19:00,179 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-25 23:19:00,179 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 197 transitions. [2022-11-25 23:19:00,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 23:19:00,180 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:19:00,180 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1] [2022-11-25 23:19:00,193 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 23:19:00,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:19:00,388 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-25 23:19:00,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:19:00,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1990905420, now seen corresponding path program 2 times [2022-11-25 23:19:00,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:19:00,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597112165] [2022-11-25 23:19:00,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:19:00,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:19:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:19:00,490 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-25 23:19:00,491 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:19:00,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597112165] [2022-11-25 23:19:00,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597112165] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:19:00,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:19:00,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:19:00,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571270518] [2022-11-25 23:19:00,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:19:00,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:19:00,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:19:00,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:19:00,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:19:00,496 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-25 23:19:00,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:19:00,591 INFO L93 Difference]: Finished difference Result 207 states and 269 transitions. [2022-11-25 23:19:00,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:19:00,591 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-25 23:19:00,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:19:00,592 INFO L225 Difference]: With dead ends: 207 [2022-11-25 23:19:00,592 INFO L226 Difference]: Without dead ends: 207 [2022-11-25 23:19:00,593 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-25 23:19:00,595 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 51 mSDsluCounter, 50 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-25 23:19:00,596 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-25 23:19:00,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-11-25 23:19:00,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 176. [2022-11-25 23:19:00,600 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-25 23:19:00,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 243 transitions. [2022-11-25 23:19:00,600 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 243 transitions. Word has length 15 [2022-11-25 23:19:00,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:19:00,601 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 243 transitions. [2022-11-25 23:19:00,601 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-25 23:19:00,601 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 243 transitions. [2022-11-25 23:19:00,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:19:00,602 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:19:00,602 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:19:00,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 23:19:00,603 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-25 23:19:00,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:19:00,604 INFO L85 PathProgramCache]: Analyzing trace with hash -279277977, now seen corresponding path program 2 times [2022-11-25 23:19:00,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:19:00,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632676982] [2022-11-25 23:19:00,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:19:00,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:19:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:19:00,986 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-25 23:19:00,986 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:19:00,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632676982] [2022-11-25 23:19:00,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632676982] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:19:00,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730799875] [2022-11-25 23:19:00,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:19:00,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:19:00,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:19:00,991 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:19:00,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 23:19:01,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-25 23:19:01,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:19:01,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-25 23:19:01,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:19:01,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:19:01,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:19:01,182 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 23:19:01,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 23:19:01,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 23:19:01,231 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 23:19:01,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 23:19:01,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 23:19:01,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:01,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 23:19:01,337 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-25 23:19:01,337 INFO L350 Elim1Store]: Elim1 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-25 23:19:01,357 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-25 23:19:01,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:19:09,602 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:19:12,724 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-25 23:19:12,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730799875] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:19:12,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [927803487] [2022-11-25 23:19:12,728 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-25 23:19:12,728 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:19:12,728 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:19:12,728 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:19:12,729 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:19:12,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:12,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:12,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 23:19:12,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:12,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:12,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:12,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:12,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:12,831 INFO L350 Elim1Store]: Elim1 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-25 23:19:12,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:12,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:12,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:12,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:12,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:12,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:12,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:12,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:12,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:12,906 INFO L350 Elim1Store]: Elim1 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-25 23:19:12,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:12,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:12,969 INFO L350 Elim1Store]: Elim1 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-25 23:19:12,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:12,995 INFO L350 Elim1Store]: Elim1 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-25 23:19:13,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:13,022 INFO L350 Elim1Store]: Elim1 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-25 23:19:13,312 INFO L321 Elim1Store]: treesize reduction 138, result has 17.9 percent of original size [2022-11-25 23:19:13,312 INFO L350 Elim1Store]: Elim1 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-25 23:19:13,736 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:19:13,794 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-25 23:19:13,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 421 treesize of output 419 [2022-11-25 23:19:13,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:13,857 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-11-25 23:19:13,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 433 treesize of output 416 [2022-11-25 23:19:13,884 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:19:13,937 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-25 23:19:13,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 429 treesize of output 427 [2022-11-25 23:19:14,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:19:14,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:19:14,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:19:14,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:19:14,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:19:14,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:19:14,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:19:14,282 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:19:15,977 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-25 23:19:15,977 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:19:15,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:19:15,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-11-25 23:19:15,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005778106] [2022-11-25 23:19:15,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:19:15,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 23:19:15,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:19:15,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 23:19:15,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-11-25 23:19:15,979 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-25 23:19:16,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:19:16,458 INFO L93 Difference]: Finished difference Result 239 states and 298 transitions. [2022-11-25 23:19:16,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 23:19:16,459 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-25 23:19:16,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:19:16,460 INFO L225 Difference]: With dead ends: 239 [2022-11-25 23:19:16,460 INFO L226 Difference]: Without dead ends: 239 [2022-11-25 23:19:16,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2022-11-25 23:19:16,461 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 309 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:19:16,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 296 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:19:16,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-11-25 23:19:16,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 174. [2022-11-25 23:19:16,464 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-25 23:19:16,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 237 transitions. [2022-11-25 23:19:16,465 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 237 transitions. Word has length 17 [2022-11-25 23:19:16,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:19:16,465 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 237 transitions. [2022-11-25 23:19:16,466 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-25 23:19:16,466 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 237 transitions. [2022-11-25 23:19:16,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 23:19:16,466 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:19:16,466 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2022-11-25 23:19:16,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 23:19:16,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 23:19:16,672 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-25 23:19:16,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:19:16,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1864429725, now seen corresponding path program 1 times [2022-11-25 23:19:16,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:19:16,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300746790] [2022-11-25 23:19:16,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:19:16,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:19:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:19:16,722 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-25 23:19:16,723 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:19:16,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300746790] [2022-11-25 23:19:16,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300746790] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:19:16,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:19:16,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:19:16,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193422863] [2022-11-25 23:19:16,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:19:16,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:19:16,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:19:16,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:19:16,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:19:16,724 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-25 23:19:16,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:19:16,821 INFO L93 Difference]: Finished difference Result 201 states and 252 transitions. [2022-11-25 23:19:16,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:19:16,822 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-25 23:19:16,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:19:16,823 INFO L225 Difference]: With dead ends: 201 [2022-11-25 23:19:16,823 INFO L226 Difference]: Without dead ends: 201 [2022-11-25 23:19:16,823 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-25 23:19:16,824 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 88 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:19:16,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 173 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:19:16,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-11-25 23:19:16,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 163. [2022-11-25 23:19:16,827 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-25 23:19:16,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 212 transitions. [2022-11-25 23:19:16,828 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 212 transitions. Word has length 18 [2022-11-25 23:19:16,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:19:16,828 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 212 transitions. [2022-11-25 23:19:16,828 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-25 23:19:16,828 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 212 transitions. [2022-11-25 23:19:16,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 23:19:16,829 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:19:16,829 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:19:16,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 23:19:16,829 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-25 23:19:16,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:19:16,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1967460204, now seen corresponding path program 1 times [2022-11-25 23:19:16,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:19:16,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407589290] [2022-11-25 23:19:16,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:19:16,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:19:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:19:16,889 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-25 23:19:16,889 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:19:16,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407589290] [2022-11-25 23:19:16,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407589290] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:19:16,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:19:16,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:19:16,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726904186] [2022-11-25 23:19:16,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:19:16,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:19:16,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:19:16,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:19:16,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:19:16,891 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-25 23:19:16,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:19:16,989 INFO L93 Difference]: Finished difference Result 179 states and 228 transitions. [2022-11-25 23:19:16,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:19:16,990 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-25 23:19:16,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:19:16,990 INFO L225 Difference]: With dead ends: 179 [2022-11-25 23:19:16,990 INFO L226 Difference]: Without dead ends: 179 [2022-11-25 23:19:16,991 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-25 23:19:16,991 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 8 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:19:16,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 189 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:19:16,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-11-25 23:19:16,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 164. [2022-11-25 23:19:16,994 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-25 23:19:16,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 213 transitions. [2022-11-25 23:19:16,995 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 213 transitions. Word has length 19 [2022-11-25 23:19:16,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:19:16,995 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 213 transitions. [2022-11-25 23:19:16,995 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-25 23:19:16,996 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 213 transitions. [2022-11-25 23:19:16,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 23:19:16,996 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:19:16,996 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:19:16,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 23:19:16,996 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-25 23:19:16,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:19:16,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1967462510, now seen corresponding path program 1 times [2022-11-25 23:19:16,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:19:16,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469041112] [2022-11-25 23:19:16,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:19:16,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:19:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:19:17,055 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-25 23:19:17,056 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:19:17,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469041112] [2022-11-25 23:19:17,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469041112] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:19:17,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:19:17,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:19:17,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106842959] [2022-11-25 23:19:17,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:19:17,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:19:17,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:19:17,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:19:17,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:19:17,057 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-25 23:19:17,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:19:17,161 INFO L93 Difference]: Finished difference Result 165 states and 213 transitions. [2022-11-25 23:19:17,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:19:17,161 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-25 23:19:17,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:19:17,162 INFO L225 Difference]: With dead ends: 165 [2022-11-25 23:19:17,162 INFO L226 Difference]: Without dead ends: 160 [2022-11-25 23:19:17,162 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-25 23:19:17,163 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 92 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-25 23:19:17,163 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-25 23:19:17,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-25 23:19:17,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2022-11-25 23:19:17,166 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-25 23:19:17,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 206 transitions. [2022-11-25 23:19:17,166 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 206 transitions. Word has length 19 [2022-11-25 23:19:17,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:19:17,167 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 206 transitions. [2022-11-25 23:19:17,167 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-25 23:19:17,167 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 206 transitions. [2022-11-25 23:19:17,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 23:19:17,168 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:19:17,168 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:19:17,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 23:19:17,168 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-25 23:19:17,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:19:17,168 INFO L85 PathProgramCache]: Analyzing trace with hash -2097964542, now seen corresponding path program 1 times [2022-11-25 23:19:17,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:19:17,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90394657] [2022-11-25 23:19:17,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:19:17,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:19:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:19:17,234 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-25 23:19:17,235 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:19:17,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90394657] [2022-11-25 23:19:17,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90394657] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:19:17,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:19:17,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:19:17,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625027278] [2022-11-25 23:19:17,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:19:17,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:19:17,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:19:17,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:19:17,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:19:17,237 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-25 23:19:17,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:19:17,334 INFO L93 Difference]: Finished difference Result 180 states and 228 transitions. [2022-11-25 23:19:17,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:19:17,335 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-25 23:19:17,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:19:17,336 INFO L225 Difference]: With dead ends: 180 [2022-11-25 23:19:17,336 INFO L226 Difference]: Without dead ends: 180 [2022-11-25 23:19:17,336 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-25 23:19:17,336 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 162 mSDsluCounter, 34 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-25 23:19:17,337 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-25 23:19:17,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-11-25 23:19:17,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 157. [2022-11-25 23:19:17,339 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-25 23:19:17,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 203 transitions. [2022-11-25 23:19:17,340 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 203 transitions. Word has length 19 [2022-11-25 23:19:17,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:19:17,340 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 203 transitions. [2022-11-25 23:19:17,340 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-25 23:19:17,341 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 203 transitions. [2022-11-25 23:19:17,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 23:19:17,341 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:19:17,341 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:19:17,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 23:19:17,342 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-25 23:19:17,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:19:17,342 INFO L85 PathProgramCache]: Analyzing trace with hash -2097964541, now seen corresponding path program 1 times [2022-11-25 23:19:17,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:19:17,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394919003] [2022-11-25 23:19:17,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:19:17,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:19:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:19:17,463 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-25 23:19:17,464 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:19:17,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394919003] [2022-11-25 23:19:17,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394919003] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:19:17,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:19:17,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:19:17,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807823295] [2022-11-25 23:19:17,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:19:17,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:19:17,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:19:17,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:19:17,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:19:17,465 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-25 23:19:17,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:19:17,552 INFO L93 Difference]: Finished difference Result 156 states and 200 transitions. [2022-11-25 23:19:17,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:19:17,553 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-25 23:19:17,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:19:17,554 INFO L225 Difference]: With dead ends: 156 [2022-11-25 23:19:17,554 INFO L226 Difference]: Without dead ends: 156 [2022-11-25 23:19:17,554 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-25 23:19:17,555 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 250 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:19:17,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 60 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:19:17,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-25 23:19:17,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2022-11-25 23:19:17,558 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-25 23:19:17,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 200 transitions. [2022-11-25 23:19:17,558 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 200 transitions. Word has length 19 [2022-11-25 23:19:17,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:19:17,559 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 200 transitions. [2022-11-25 23:19:17,559 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-25 23:19:17,559 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 200 transitions. [2022-11-25 23:19:17,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 23:19:17,559 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:19:17,559 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:19:17,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 23:19:17,560 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-25 23:19:17,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:19:17,560 INFO L85 PathProgramCache]: Analyzing trace with hash -612391313, now seen corresponding path program 1 times [2022-11-25 23:19:17,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:19:17,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075531745] [2022-11-25 23:19:17,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:19:17,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:19:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:19:17,996 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-25 23:19:17,996 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:19:17,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075531745] [2022-11-25 23:19:17,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075531745] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:19:17,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829641833] [2022-11-25 23:19:17,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:19:17,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:19:17,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:19:17,998 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:19:18,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 23:19:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:19:18,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-25 23:19:18,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:19:18,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:19:18,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:18,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 23:19:18,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:18,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 23:19:18,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:18,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 23:19:18,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:18,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 23:19:18,332 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-25 23:19:18,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:19:20,502 WARN L837 $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-25 23:19:22,602 WARN L837 $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-25 23:19:24,733 WARN L837 $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-25 23:19:24,824 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-25 23:19:24,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829641833] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:19:24,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2091418877] [2022-11-25 23:19:24,826 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-25 23:19:24,827 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:19:24,827 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:19:24,827 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:19:24,827 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:19:24,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:24,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:24,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 23:19:24,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:24,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:24,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:24,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:24,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:24,922 INFO L350 Elim1Store]: Elim1 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-25 23:19:24,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:24,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:24,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:24,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:24,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:24,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:24,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:24,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:24,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:24,994 INFO L350 Elim1Store]: Elim1 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-25 23:19:25,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:25,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:25,054 INFO L350 Elim1Store]: Elim1 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-25 23:19:25,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:25,073 INFO L350 Elim1Store]: Elim1 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-25 23:19:25,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:25,098 INFO L350 Elim1Store]: Elim1 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-25 23:19:25,367 INFO L321 Elim1Store]: treesize reduction 138, result has 17.9 percent of original size [2022-11-25 23:19:25,367 INFO L350 Elim1Store]: Elim1 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-25 23:19:25,798 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:19:25,861 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-25 23:19:25,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 417 treesize of output 415 [2022-11-25 23:19:25,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:25,926 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-11-25 23:19:25,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 457 treesize of output 440 [2022-11-25 23:19:25,954 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:19:26,006 INFO L321 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2022-11-25 23:19:26,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 453 treesize of output 451 [2022-11-25 23:19:26,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:19:26,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:19:26,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:19:26,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:19:26,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:19:26,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:19:26,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:19:26,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:19:26,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 23:19:26,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:19:26,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:26,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 23:19:26,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:26,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 23:19:26,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:19:26,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:26,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-25 23:19:26,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:26,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-25 23:19:26,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:19:26,594 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:19:28,926 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5621#(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-25 23:19:28,926 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:19:28,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:19:28,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 5] total 9 [2022-11-25 23:19:28,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903552822] [2022-11-25 23:19:28,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:19:28,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 23:19:28,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:19:28,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 23:19:28,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=247, Unknown=3, NotChecked=102, Total=420 [2022-11-25 23:19:28,929 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-25 23:19:33,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:19:33,206 INFO L93 Difference]: Finished difference Result 175 states and 217 transitions. [2022-11-25 23:19:33,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:19:33,207 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-25 23:19:33,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:19:33,208 INFO L225 Difference]: With dead ends: 175 [2022-11-25 23:19:33,208 INFO L226 Difference]: Without dead ends: 175 [2022-11-25 23:19:33,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=86, Invalid=303, Unknown=3, NotChecked=114, Total=506 [2022-11-25 23:19:33,209 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 310 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 267 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:19:33,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 49 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 267 Unchecked, 0.2s Time] [2022-11-25 23:19:33,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-11-25 23:19:33,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 152. [2022-11-25 23:19:33,212 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-25 23:19:33,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 192 transitions. [2022-11-25 23:19:33,213 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 192 transitions. Word has length 20 [2022-11-25 23:19:33,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:19:33,213 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 192 transitions. [2022-11-25 23:19:33,213 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-25 23:19:33,213 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 192 transitions. [2022-11-25 23:19:33,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 23:19:33,214 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:19:33,214 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:19:33,222 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 23:19:33,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 23:19:33,414 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-25 23:19:33,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:19:33,415 INFO L85 PathProgramCache]: Analyzing trace with hash -612391314, now seen corresponding path program 1 times [2022-11-25 23:19:33,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:19:33,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258132221] [2022-11-25 23:19:33,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:19:33,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:19:33,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:19:33,721 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-25 23:19:33,721 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:19:33,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258132221] [2022-11-25 23:19:33,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258132221] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:19:33,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886556298] [2022-11-25 23:19:33,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:19:33,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:19:33,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:19:33,727 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:19:33,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 23:19:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:19:33,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-25 23:19:33,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:19:33,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:19:33,902 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:19:33,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-25 23:19:33,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:33,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 23:19:33,977 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:19:33,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-25 23:19:34,062 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-11-25 23:19:34,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 38 [2022-11-25 23:19:34,165 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-25 23:19:34,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:19:34,399 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-25 23:19:34,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886556298] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:19:34,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1163141046] [2022-11-25 23:19:34,402 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-25 23:19:34,402 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:19:34,403 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:19:34,403 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:19:34,403 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:19:34,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:34,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:34,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 23:19:34,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:34,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:34,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:34,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:34,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:34,486 INFO L350 Elim1Store]: Elim1 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-25 23:19:34,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:34,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:34,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:34,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:34,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:34,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:34,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:34,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:34,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:34,566 INFO L350 Elim1Store]: Elim1 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-25 23:19:34,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:34,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:34,624 INFO L350 Elim1Store]: Elim1 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-25 23:19:34,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:34,641 INFO L350 Elim1Store]: Elim1 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-25 23:19:34,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:34,665 INFO L350 Elim1Store]: Elim1 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-25 23:19:34,925 INFO L321 Elim1Store]: treesize reduction 138, result has 17.9 percent of original size [2022-11-25 23:19:34,925 INFO L350 Elim1Store]: Elim1 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-25 23:19:35,295 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:19:35,364 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-25 23:19:35,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 421 treesize of output 419 [2022-11-25 23:19:35,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:35,417 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-11-25 23:19:35,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 465 treesize of output 448 [2022-11-25 23:19:35,442 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:19:35,487 INFO L321 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2022-11-25 23:19:35,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 461 treesize of output 459 [2022-11-25 23:19:35,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:19:35,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:19:35,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:19:35,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:19:35,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:19:35,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:19:35,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:19:35,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 23:19:35,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:19:35,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:19:35,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:35,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 23:19:35,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:35,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 23:19:35,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:19:35,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:19:35,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:35,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-25 23:19:36,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:36,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-25 23:19:36,035 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:19:38,381 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6093#(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-25 23:19:38,381 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:19:38,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:19:38,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 12 [2022-11-25 23:19:38,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910364801] [2022-11-25 23:19:38,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:19:38,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 23:19:38,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:19:38,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 23:19:38,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2022-11-25 23:19:38,384 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-25 23:19:38,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:19:38,601 INFO L93 Difference]: Finished difference Result 173 states and 211 transitions. [2022-11-25 23:19:38,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:19:38,602 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-25 23:19:38,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:19:38,603 INFO L225 Difference]: With dead ends: 173 [2022-11-25 23:19:38,603 INFO L226 Difference]: Without dead ends: 173 [2022-11-25 23:19:38,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2022-11-25 23:19:38,604 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 447 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:19:38,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 131 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:19:38,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-11-25 23:19:38,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 150. [2022-11-25 23:19:38,607 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-25 23:19:38,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 186 transitions. [2022-11-25 23:19:38,608 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 186 transitions. Word has length 20 [2022-11-25 23:19:38,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:19:38,608 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 186 transitions. [2022-11-25 23:19:38,608 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-25 23:19:38,608 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 186 transitions. [2022-11-25 23:19:38,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 23:19:38,609 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:19:38,609 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:19:38,626 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 23:19:38,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-25 23:19:38,813 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-25 23:19:38,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:19:38,813 INFO L85 PathProgramCache]: Analyzing trace with hash -97352723, now seen corresponding path program 1 times [2022-11-25 23:19:38,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:19:38,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220035802] [2022-11-25 23:19:38,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:19:38,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:19:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:19:39,408 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-25 23:19:39,408 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:19:39,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220035802] [2022-11-25 23:19:39,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220035802] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:19:39,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597065538] [2022-11-25 23:19:39,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:19:39,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:19:39,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:19:39,410 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:19:39,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 23:19:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:19:39,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-25 23:19:39,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:19:39,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:39,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 23:19:39,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:39,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 23:19:39,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:39,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 23:19:39,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:39,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 23:19:39,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:39,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 23:19:39,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:39,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-25 23:19:40,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:40,072 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-25 23:19:40,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 34 [2022-11-25 23:19:40,117 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:19:40,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 23:19:40,232 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-25 23:19:40,233 INFO L350 Elim1Store]: Elim1 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-25 23:19:40,269 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:19:40,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-11-25 23:19:40,373 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 23:19:40,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-11-25 23:19:40,411 INFO L321 Elim1Store]: treesize reduction 32, result has 41.8 percent of original size [2022-11-25 23:19:40,412 INFO L350 Elim1Store]: Elim1 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-25 23:19:40,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:19:40,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:40,651 INFO L350 Elim1Store]: Elim1 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-25 23:19:40,655 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-25 23:19:40,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:19:40,714 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:19:40,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2022-11-25 23:19:40,723 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:19:40,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2022-11-25 23:19:41,349 WARN L837 $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-25 23:19:41,378 WARN L837 $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-25 23:19:44,057 WARN L837 $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-25 23:19:46,154 WARN L837 $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-25 23:19:46,215 WARN L837 $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-25 23:19:46,362 WARN L837 $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-25 23:19:46,628 WARN L837 $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-25 23:19:46,769 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-25 23:19:46,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597065538] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:19:46,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1491724610] [2022-11-25 23:19:46,772 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-25 23:19:46,772 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:19:46,772 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:19:46,773 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:19:46,773 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:19:46,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:46,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:46,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 23:19:46,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:46,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:46,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:46,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:46,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:46,860 INFO L350 Elim1Store]: Elim1 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-25 23:19:46,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:46,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:46,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:46,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:46,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:46,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:46,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:46,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:46,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:46,938 INFO L350 Elim1Store]: Elim1 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-25 23:19:46,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:46,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:46,997 INFO L350 Elim1Store]: Elim1 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-25 23:19:47,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:47,023 INFO L350 Elim1Store]: Elim1 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-25 23:19:47,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:47,042 INFO L350 Elim1Store]: Elim1 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-25 23:19:47,316 INFO L321 Elim1Store]: treesize reduction 138, result has 17.9 percent of original size [2022-11-25 23:19:47,317 INFO L350 Elim1Store]: Elim1 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-25 23:19:47,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:47,749 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-11-25 23:19:47,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 425 treesize of output 408 [2022-11-25 23:19:47,773 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:19:47,774 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:19:47,819 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-25 23:19:47,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 421 treesize of output 419 [2022-11-25 23:19:47,846 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:19:47,847 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:19:47,898 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-25 23:19:47,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 437 treesize of output 435 [2022-11-25 23:19:48,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:19:48,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:19:48,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:19:48,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:19:48,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:19:48,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:19:48,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:19:48,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 23:19:48,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:19:48,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:19:48,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:48,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 23:19:48,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:19:48,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:48,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 23:19:48,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:19:48,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:48,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-25 23:19:48,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:19:48,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-25 23:19:48,461 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:19:52,640 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6584#(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-25 23:19:52,641 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:19:52,641 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:19:52,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2022-11-25 23:19:52,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271069007] [2022-11-25 23:19:52,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:19:52,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-25 23:19:52,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:19:52,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-25 23:19:52,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1025, Unknown=24, NotChecked=504, Total=1722 [2022-11-25 23:19:52,647 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-25 23:20:02,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:20:02,676 INFO L93 Difference]: Finished difference Result 270 states and 321 transitions. [2022-11-25 23:20:02,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:20:02,677 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-25 23:20:02,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:20:02,678 INFO L225 Difference]: With dead ends: 270 [2022-11-25 23:20:02,678 INFO L226 Difference]: Without dead ends: 270 [2022-11-25 23:20:02,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=307, Invalid=1419, Unknown=24, NotChecked=602, Total=2352 [2022-11-25 23:20:02,679 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 109 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 36 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 636 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:20:02,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 611 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 383 Invalid, 2 Unknown, 636 Unchecked, 0.6s Time] [2022-11-25 23:20:02,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-11-25 23:20:02,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 201. [2022-11-25 23:20:02,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 175 states have (on average 1.3714285714285714) internal successors, (240), 200 states have internal predecessors, (240), 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-25 23:20:02,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 240 transitions. [2022-11-25 23:20:02,684 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 240 transitions. Word has length 22 [2022-11-25 23:20:02,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:20:02,684 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 240 transitions. [2022-11-25 23:20:02,684 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-25 23:20:02,684 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 240 transitions. [2022-11-25 23:20:02,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 23:20:02,685 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:20:02,685 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-25 23:20:02,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 23:20:02,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-25 23:20:02,899 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-25 23:20:02,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:20:02,900 INFO L85 PathProgramCache]: Analyzing trace with hash 394628186, now seen corresponding path program 1 times [2022-11-25 23:20:02,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:20:02,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051478469] [2022-11-25 23:20:02,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:20:02,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:20:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:20:03,039 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-25 23:20:03,039 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:20:03,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051478469] [2022-11-25 23:20:03,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051478469] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:20:03,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:20:03,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:20:03,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762821614] [2022-11-25 23:20:03,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:20:03,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:20:03,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:20:03,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:20:03,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:20:03,043 INFO L87 Difference]: Start difference. First operand 201 states and 240 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-25 23:20:03,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:20:03,158 INFO L93 Difference]: Finished difference Result 253 states and 292 transitions. [2022-11-25 23:20:03,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:20:03,158 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-25 23:20:03,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:20:03,160 INFO L225 Difference]: With dead ends: 253 [2022-11-25 23:20:03,160 INFO L226 Difference]: Without dead ends: 253 [2022-11-25 23:20:03,160 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-25 23:20:03,160 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 205 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:20:03,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 100 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:20:03,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-11-25 23:20:03,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 201. [2022-11-25 23:20:03,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 175 states have (on average 1.3714285714285714) internal successors, (240), 200 states have internal predecessors, (240), 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-25 23:20:03,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 240 transitions. [2022-11-25 23:20:03,165 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 240 transitions. Word has length 39 [2022-11-25 23:20:03,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:20:03,165 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 240 transitions. [2022-11-25 23:20:03,165 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-25 23:20:03,166 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 240 transitions. [2022-11-25 23:20:03,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 23:20:03,166 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:20:03,166 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-25 23:20:03,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 23:20:03,167 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-25 23:20:03,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:20:03,167 INFO L85 PathProgramCache]: Analyzing trace with hash -646714545, now seen corresponding path program 1 times [2022-11-25 23:20:03,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:20:03,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5044299] [2022-11-25 23:20:03,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:20:03,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:20:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:20:03,319 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-25 23:20:03,319 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:20:03,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5044299] [2022-11-25 23:20:03,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5044299] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:20:03,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:20:03,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:20:03,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378205577] [2022-11-25 23:20:03,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:20:03,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:20:03,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:20:03,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:20:03,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:20:03,321 INFO L87 Difference]: Start difference. First operand 201 states and 240 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-25 23:20:03,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:20:03,495 INFO L93 Difference]: Finished difference Result 227 states and 273 transitions. [2022-11-25 23:20:03,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:20:03,496 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-25 23:20:03,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:20:03,498 INFO L225 Difference]: With dead ends: 227 [2022-11-25 23:20:03,498 INFO L226 Difference]: Without dead ends: 227 [2022-11-25 23:20:03,498 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-25 23:20:03,499 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 39 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:20:03,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 200 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:20:03,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-11-25 23:20:03,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 218. [2022-11-25 23:20:03,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 192 states have (on average 1.4010416666666667) internal successors, (269), 217 states have internal predecessors, (269), 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-25 23:20:03,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 269 transitions. [2022-11-25 23:20:03,504 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 269 transitions. Word has length 40 [2022-11-25 23:20:03,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:20:03,504 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 269 transitions. [2022-11-25 23:20:03,504 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-25 23:20:03,504 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 269 transitions. [2022-11-25 23:20:03,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 23:20:03,505 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:20:03,505 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-25 23:20:03,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 23:20:03,505 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-25 23:20:03,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:20:03,506 INFO L85 PathProgramCache]: Analyzing trace with hash -646712239, now seen corresponding path program 1 times [2022-11-25 23:20:03,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:20:03,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133846159] [2022-11-25 23:20:03,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:20:03,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:20:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:20:03,745 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-25 23:20:03,746 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:20:03,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133846159] [2022-11-25 23:20:03,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133846159] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:20:03,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:20:03,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 23:20:03,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925344004] [2022-11-25 23:20:03,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:20:03,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:20:03,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:20:03,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:20:03,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:20:03,748 INFO L87 Difference]: Start difference. First operand 218 states and 269 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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-25 23:20:03,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:20:03,958 INFO L93 Difference]: Finished difference Result 319 states and 387 transitions. [2022-11-25 23:20:03,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:20:03,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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-25 23:20:03,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:20:03,960 INFO L225 Difference]: With dead ends: 319 [2022-11-25 23:20:03,961 INFO L226 Difference]: Without dead ends: 319 [2022-11-25 23:20:03,961 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-25 23:20:03,962 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 406 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:20:03,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 189 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:20:03,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-11-25 23:20:03,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 247. [2022-11-25 23:20:03,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 221 states have (on average 1.407239819004525) internal successors, (311), 246 states have internal predecessors, (311), 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-25 23:20:03,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 311 transitions. [2022-11-25 23:20:03,968 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 311 transitions. Word has length 40 [2022-11-25 23:20:03,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:20:03,969 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 311 transitions. [2022-11-25 23:20:03,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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-25 23:20:03,969 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 311 transitions. [2022-11-25 23:20:03,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 23:20:03,969 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:20:03,970 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-25 23:20:03,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 23:20:03,970 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-25 23:20:03,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:20:03,970 INFO L85 PathProgramCache]: Analyzing trace with hash -651429305, now seen corresponding path program 1 times [2022-11-25 23:20:03,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:20:03,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102776022] [2022-11-25 23:20:03,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:20:03,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:20:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:20:04,239 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-25 23:20:04,239 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:20:04,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102776022] [2022-11-25 23:20:04,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102776022] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:20:04,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:20:04,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 23:20:04,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480586685] [2022-11-25 23:20:04,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:20:04,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 23:20:04,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:20:04,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 23:20:04,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:20:04,242 INFO L87 Difference]: Start difference. First operand 247 states and 311 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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-25 23:20:04,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:20:04,617 INFO L93 Difference]: Finished difference Result 397 states and 480 transitions. [2022-11-25 23:20:04,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 23:20:04,618 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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-25 23:20:04,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:20:04,619 INFO L225 Difference]: With dead ends: 397 [2022-11-25 23:20:04,620 INFO L226 Difference]: Without dead ends: 397 [2022-11-25 23:20:04,620 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-25 23:20:04,620 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 527 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:20:04,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 194 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:20:04,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-11-25 23:20:04,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 252. [2022-11-25 23:20:04,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 227 states have (on average 1.4096916299559472) internal successors, (320), 251 states have internal predecessors, (320), 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-25 23:20:04,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 320 transitions. [2022-11-25 23:20:04,627 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 320 transitions. Word has length 40 [2022-11-25 23:20:04,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:20:04,628 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 320 transitions. [2022-11-25 23:20:04,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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-25 23:20:04,628 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 320 transitions. [2022-11-25 23:20:04,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 23:20:04,629 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:20:04,629 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-25 23:20:04,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-25 23:20:04,630 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-25 23:20:04,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:20:04,630 INFO L85 PathProgramCache]: Analyzing trace with hash -651429304, now seen corresponding path program 1 times [2022-11-25 23:20:04,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:20:04,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748299833] [2022-11-25 23:20:04,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:20:04,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:20:04,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:20:04,867 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:20:04,867 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:20:04,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748299833] [2022-11-25 23:20:04,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748299833] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:20:04,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894278651] [2022-11-25 23:20:04,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:20:04,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:20:04,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:20:04,869 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:20:04,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 23:20:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:20:05,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 23:20:05,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:20:05,113 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:20:05,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:20:05,209 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:20:05,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894278651] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:20:05,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [619999317] [2022-11-25 23:20:05,213 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2022-11-25 23:20:05,214 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:20:05,214 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:20:05,215 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:20:05,215 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:20:05,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:05,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:05,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 23:20:05,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:20:05,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:20:05,504 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:20:05,515 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:20:05,517 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:20:05,554 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 23:20:05,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 23:20:05,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 23:20:05,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:20:05,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:20:05,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:20:05,753 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:20:05,755 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:20:05,759 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:20:05,851 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-25 23:20:05,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 213 [2022-11-25 23:20:05,927 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-11-25 23:20:05,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 209 treesize of output 226 [2022-11-25 23:20:06,140 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:20:06,155 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 23:20:06,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 206 treesize of output 205 [2022-11-25 23:20:06,171 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:20:06,187 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-11-25 23:20:06,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 242 treesize of output 241 [2022-11-25 23:20:06,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:20:06,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:20:06,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 23:20:06,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:20:06,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:06,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 23:20:06,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:06,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 23:20:06,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:20:06,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:20:06,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:06,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-25 23:20:06,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:06,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-25 23:20:06,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:20:06,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:06,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:06,654 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:20:06,669 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 23:20:06,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 33 [2022-11-25 23:20:06,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:06,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:06,690 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:20:06,708 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-25 23:20:06,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 37 [2022-11-25 23:20:07,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:20:07,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:20:07,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:20:07,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:20:07,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:20:07,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:20:07,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:20:07,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:20:07,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:20:07,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 23:20:07,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:07,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 23:20:07,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:20:07,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:07,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 23:20:07,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:07,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-25 23:20:07,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:20:07,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:07,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-25 23:20:07,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:20:07,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:07,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:07,501 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:20:07,517 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-25 23:20:07,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 37 [2022-11-25 23:20:07,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:07,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:07,549 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:20:07,564 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 23:20:07,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 33 [2022-11-25 23:20:07,842 INFO L321 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2022-11-25 23:20:07,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2022-11-25 23:20:07,868 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 23:20:07,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 29 treesize of output 34 [2022-11-25 23:20:08,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:20:08,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:20:08,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:20:08,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:20:08,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:20:08,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:20:08,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:20:08,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:20:08,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 23:20:08,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:20:08,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:20:08,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:08,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 23:20:08,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:08,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 23:20:08,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:20:08,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:08,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-25 23:20:08,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:08,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-25 23:20:08,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:08,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:08,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:20:08,763 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-25 23:20:08,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 37 [2022-11-25 23:20:08,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:08,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:08,792 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:20:08,806 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 23:20:08,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 33 [2022-11-25 23:20:08,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:20:09,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-25 23:20:09,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:20:09,073 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:20:12,490 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9498#(and (= |ULTIMATE.start_main_~ptr~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#head~1#1.base|) |ULTIMATE.start_main_~#head~1#1.offset|)) (or (not (<= (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|))) (not (<= 0 (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#head~1#1.base|) |ULTIMATE.start_main_~#head~1#1.offset|) |ULTIMATE.start_main_~ptr~0#1.base|) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (= 5 |ULTIMATE.start_main_~max~0#1|) (= |ULTIMATE.start_main_~#head~1#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#head~1#1.base|) (= |ULTIMATE.start_main_~min~0#1| |ULTIMATE.start_main_~i~0#1|) (= 3 |ULTIMATE.start_main_~min~0#1|) (<= (+ |ULTIMATE.start_main_~#head~1#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#head~1#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#head~1#1.base|) 1) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-25 23:20:12,490 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:20:12,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:20:12,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-11-25 23:20:12,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867224405] [2022-11-25 23:20:12,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:20:12,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 23:20:12,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:20:12,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 23:20:12,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2022-11-25 23:20:12,492 INFO L87 Difference]: Start difference. First operand 252 states and 320 transitions. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 14 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-25 23:20:13,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:20:13,375 INFO L93 Difference]: Finished difference Result 703 states and 900 transitions. [2022-11-25 23:20:13,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-25 23:20:13,376 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 14 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 40 [2022-11-25 23:20:13,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:20:13,383 INFO L225 Difference]: With dead ends: 703 [2022-11-25 23:20:13,383 INFO L226 Difference]: Without dead ends: 703 [2022-11-25 23:20:13,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 84 SyntacticMatches, 15 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=355, Invalid=1537, Unknown=0, NotChecked=0, Total=1892 [2022-11-25 23:20:13,386 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 393 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:20:13,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1367 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:20:13,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2022-11-25 23:20:13,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 303. [2022-11-25 23:20:13,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 278 states have (on average 1.4280575539568345) internal successors, (397), 302 states have internal predecessors, (397), 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-25 23:20:13,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 397 transitions. [2022-11-25 23:20:13,399 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 397 transitions. Word has length 40 [2022-11-25 23:20:13,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:20:13,399 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 397 transitions. [2022-11-25 23:20:13,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 14 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-25 23:20:13,400 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 397 transitions. [2022-11-25 23:20:13,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 23:20:13,401 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:20:13,401 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-25 23:20:13,413 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 23:20:13,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:20:13,609 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-25 23:20:13,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:20:13,609 INFO L85 PathProgramCache]: Analyzing trace with hash 260355584, now seen corresponding path program 2 times [2022-11-25 23:20:13,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:20:13,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48461662] [2022-11-25 23:20:13,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:20:13,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:20:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:20:14,082 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-25 23:20:14,082 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:20:14,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48461662] [2022-11-25 23:20:14,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48461662] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:20:14,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:20:14,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 23:20:14,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946531926] [2022-11-25 23:20:14,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:20:14,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 23:20:14,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:20:14,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 23:20:14,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:20:14,084 INFO L87 Difference]: Start difference. First operand 303 states and 397 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-25 23:20:14,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:20:14,416 INFO L93 Difference]: Finished difference Result 386 states and 498 transitions. [2022-11-25 23:20:14,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:20:14,416 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-25 23:20:14,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:20:14,418 INFO L225 Difference]: With dead ends: 386 [2022-11-25 23:20:14,418 INFO L226 Difference]: Without dead ends: 386 [2022-11-25 23:20:14,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-25 23:20:14,419 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 384 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:20:14,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 160 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:20:14,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-11-25 23:20:14,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 305. [2022-11-25 23:20:14,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 280 states have (on average 1.417857142857143) internal successors, (397), 304 states have internal predecessors, (397), 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-25 23:20:14,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 397 transitions. [2022-11-25 23:20:14,427 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 397 transitions. Word has length 40 [2022-11-25 23:20:14,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:20:14,427 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 397 transitions. [2022-11-25 23:20:14,428 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-25 23:20:14,428 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 397 transitions. [2022-11-25 23:20:14,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-25 23:20:14,428 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:20:14,429 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-25 23:20:14,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-25 23:20:14,429 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-25 23:20:14,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:20:14,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1093730647, now seen corresponding path program 1 times [2022-11-25 23:20:14,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:20:14,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967219159] [2022-11-25 23:20:14,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:20:14,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:20:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:20:15,401 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-25 23:20:15,402 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:20:15,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967219159] [2022-11-25 23:20:15,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967219159] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:20:15,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253673923] [2022-11-25 23:20:15,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:20:15,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:20:15,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:20:15,404 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:20:15,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e39d844-b053-4cc4-8d3e-e4cce8ec84f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 23:20:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:20:15,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-25 23:20:15,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:20:15,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:20:15,650 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 23:20:15,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 23:20:15,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:20:16,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:20:16,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-11-25 23:20:16,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:20:16,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-11-25 23:20:16,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-11-25 23:20:16,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 23:20:16,833 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:20:16,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:16,842 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-11-25 23:20:16,842 INFO L350 Elim1Store]: Elim1 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 90 treesize of output 46 [2022-11-25 23:20:16,855 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 23:20:16,855 INFO L350 Elim1Store]: Elim1 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-25 23:20:16,891 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-25 23:20:16,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:20:17,380 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:20:17,381 INFO L350 Elim1Store]: Elim1 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-25 23:31:59,131 WARN L233 SmtUtils]: Spent 11.52m on a formula simplification. DAG size of input: 166 DAG size of output: 119 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)