./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 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/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_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh --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-2329fc7 [2022-12-14 12:27:55,833 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 12:27:55,835 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 12:27:55,853 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 12:27:55,853 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 12:27:55,854 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 12:27:55,855 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 12:27:55,857 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 12:27:55,858 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 12:27:55,859 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 12:27:55,860 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 12:27:55,861 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 12:27:55,861 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 12:27:55,862 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 12:27:55,864 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 12:27:55,865 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 12:27:55,865 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 12:27:55,866 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 12:27:55,868 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 12:27:55,869 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 12:27:55,871 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 12:27:55,872 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 12:27:55,873 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 12:27:55,874 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 12:27:55,877 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 12:27:55,877 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 12:27:55,877 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 12:27:55,878 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 12:27:55,879 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 12:27:55,879 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 12:27:55,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 12:27:55,880 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 12:27:55,881 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 12:27:55,882 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 12:27:55,882 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 12:27:55,883 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 12:27:55,883 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 12:27:55,883 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 12:27:55,884 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 12:27:55,884 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 12:27:55,885 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 12:27:55,886 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-12-14 12:27:55,905 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 12:27:55,905 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 12:27:55,905 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 12:27:55,905 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 12:27:55,906 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 12:27:55,906 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 12:27:55,906 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 12:27:55,907 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 12:27:55,907 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 12:27:55,907 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 12:27:55,907 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 12:27:55,907 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 12:27:55,907 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 12:27:55,907 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 12:27:55,908 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 12:27:55,908 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 12:27:55,908 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 12:27:55,908 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 12:27:55,909 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 12:27:55,909 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 12:27:55,909 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 12:27:55,909 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 12:27:55,909 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 12:27:55,909 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 12:27:55,910 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 12:27:55,910 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 12:27:55,910 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 12:27:55,910 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 12:27:55,910 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 12:27:55,910 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 12:27:55,911 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 12:27:55,911 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 12:27:55,911 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 12:27:55,911 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 12:27:55,911 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 12:27:55,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 12:27:55,912 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 12:27:55,912 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 12:27:55,912 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 12:27:55,912 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 12:27:55,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 12:27:55,912 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 12:27:55,913 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_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/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_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh 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-12-14 12:27:56,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 12:27:56,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 12:27:56,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 12:27:56,119 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 12:27:56,119 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 12:27:56,121 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i [2022-12-14 12:27:58,774 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 12:27:58,933 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 12:27:58,933 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i [2022-12-14 12:27:58,942 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/data/979e252a9/69af417d0dac469980c8d81d6b5d936c/FLAGcc1033129 [2022-12-14 12:27:58,953 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/data/979e252a9/69af417d0dac469980c8d81d6b5d936c [2022-12-14 12:27:58,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 12:27:58,956 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 12:27:58,957 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 12:27:58,957 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 12:27:58,961 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 12:27:58,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 12:27:58" (1/1) ... [2022-12-14 12:27:58,962 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48e39afc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:58, skipping insertion in model container [2022-12-14 12:27:58,963 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 12:27:58" (1/1) ... [2022-12-14 12:27:58,970 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 12:27:59,002 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 12:27:59,258 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_4aeec7bf-b4a2-463d-9d88-b353d0622b18/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i[24987,25000] [2022-12-14 12:27:59,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 12:27:59,270 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 12:27:59,309 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_4aeec7bf-b4a2-463d-9d88-b353d0622b18/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i[24987,25000] [2022-12-14 12:27:59,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 12:27:59,334 INFO L208 MainTranslator]: Completed translation [2022-12-14 12:27:59,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:59 WrapperNode [2022-12-14 12:27:59,334 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 12:27:59,335 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 12:27:59,336 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 12:27:59,336 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 12:27:59,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:59" (1/1) ... [2022-12-14 12:27:59,355 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:59" (1/1) ... [2022-12-14 12:27:59,377 INFO L138 Inliner]: procedures = 129, calls = 39, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 185 [2022-12-14 12:27:59,378 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 12:27:59,378 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 12:27:59,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 12:27:59,378 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 12:27:59,388 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:59" (1/1) ... [2022-12-14 12:27:59,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:59" (1/1) ... [2022-12-14 12:27:59,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:59" (1/1) ... [2022-12-14 12:27:59,391 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:59" (1/1) ... [2022-12-14 12:27:59,398 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:59" (1/1) ... [2022-12-14 12:27:59,403 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:59" (1/1) ... [2022-12-14 12:27:59,405 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:59" (1/1) ... [2022-12-14 12:27:59,406 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:59" (1/1) ... [2022-12-14 12:27:59,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 12:27:59,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 12:27:59,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 12:27:59,410 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 12:27:59,411 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:59" (1/1) ... [2022-12-14 12:27:59,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 12:27:59,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:27:59,437 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 12:27:59,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 12:27:59,471 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-12-14 12:27:59,471 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-12-14 12:27:59,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 12:27:59,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 12:27:59,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 12:27:59,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 12:27:59,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 12:27:59,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 12:27:59,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-14 12:27:59,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 12:27:59,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 12:27:59,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 12:27:59,559 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 12:27:59,561 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 12:27:59,578 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-12-14 12:27:59,867 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 12:27:59,922 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 12:27:59,922 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-12-14 12:27:59,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 12:27:59 BoogieIcfgContainer [2022-12-14 12:27:59,924 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 12:27:59,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 12:27:59,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 12:27:59,930 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 12:27:59,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 12:27:58" (1/3) ... [2022-12-14 12:27:59,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51fba691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 12:27:59, skipping insertion in model container [2022-12-14 12:27:59,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:27:59" (2/3) ... [2022-12-14 12:27:59,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51fba691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 12:27:59, skipping insertion in model container [2022-12-14 12:27:59,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 12:27:59" (3/3) ... [2022-12-14 12:27:59,933 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-1.i [2022-12-14 12:27:59,949 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 12:27:59,949 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2022-12-14 12:27:59,981 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 12:27:59,986 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;@773bac89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 12:27:59,986 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2022-12-14 12:27:59,989 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-12-14 12:27:59,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 12:27:59,993 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:27:59,994 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 12:27:59,994 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-12-14 12:27:59,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:27:59,998 INFO L85 PathProgramCache]: Analyzing trace with hash 296546, now seen corresponding path program 1 times [2022-12-14 12:28:00,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:28:00,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148934515] [2022-12-14 12:28:00,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:28:00,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:28:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:28:00,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:28:00,164 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:28:00,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148934515] [2022-12-14 12:28:00,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148934515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:28:00,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:28:00,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 12:28:00,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482806976] [2022-12-14 12:28:00,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:28:00,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 12:28:00,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:28:00,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 12:28:00,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 12:28:00,193 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-12-14 12:28:00,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:28:00,299 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2022-12-14 12:28:00,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 12:28:00,301 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-12-14 12:28:00,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:28:00,305 INFO L225 Difference]: With dead ends: 115 [2022-12-14 12:28:00,305 INFO L226 Difference]: Without dead ends: 110 [2022-12-14 12:28:00,306 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-12-14 12:28:00,308 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-12-14 12:28:00,309 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-12-14 12:28:00,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-12-14 12:28:00,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 87. [2022-12-14 12:28:00,331 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-12-14 12:28:00,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2022-12-14 12:28:00,333 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 3 [2022-12-14 12:28:00,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:28:00,333 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2022-12-14 12:28:00,333 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-12-14 12:28:00,333 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2022-12-14 12:28:00,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 12:28:00,333 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:28:00,333 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 12:28:00,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 12:28:00,334 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-12-14 12:28:00,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:28:00,334 INFO L85 PathProgramCache]: Analyzing trace with hash 296547, now seen corresponding path program 1 times [2022-12-14 12:28:00,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:28:00,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840349986] [2022-12-14 12:28:00,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:28:00,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:28:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:28:00,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:28:00,391 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:28:00,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840349986] [2022-12-14 12:28:00,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840349986] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:28:00,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:28:00,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 12:28:00,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089106333] [2022-12-14 12:28:00,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:28:00,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 12:28:00,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:28:00,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 12:28:00,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 12:28:00,393 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-12-14 12:28:00,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:28:00,459 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2022-12-14 12:28:00,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 12:28:00,460 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-12-14 12:28:00,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:28:00,461 INFO L225 Difference]: With dead ends: 125 [2022-12-14 12:28:00,461 INFO L226 Difference]: Without dead ends: 125 [2022-12-14 12:28:00,461 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-12-14 12:28:00,462 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 41 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12-14 12:28:00,462 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-12-14 12:28:00,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-12-14 12:28:00,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 88. [2022-12-14 12:28:00,466 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-12-14 12:28:00,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2022-12-14 12:28:00,467 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 3 [2022-12-14 12:28:00,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:28:00,467 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2022-12-14 12:28:00,468 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-12-14 12:28:00,468 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2022-12-14 12:28:00,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 12:28:00,468 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:28:00,468 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:28:00,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 12:28:00,468 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-12-14 12:28:00,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:28:00,469 INFO L85 PathProgramCache]: Analyzing trace with hash -226155663, now seen corresponding path program 1 times [2022-12-14 12:28:00,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:28:00,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691567989] [2022-12-14 12:28:00,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:28:00,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:28:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:28:00,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:28:00,515 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:28:00,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691567989] [2022-12-14 12:28:00,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691567989] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:28:00,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084648171] [2022-12-14 12:28:00,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:28:00,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:28:00,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:28:00,517 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:28:00,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 12:28:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:28:00,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 12:28:00,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:28:00,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:28:00,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:28:00,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:28:00,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084648171] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:28:00,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1176649764] [2022-12-14 12:28:00,678 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 12:28:00,678 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:28:00,681 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 12:28:00,684 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 12:28:00,685 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 12:28:00,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:00,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:00,748 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-12-14 12:28:01,035 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 12:28:01,247 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-12-14 12:28:01,247 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 12:28:01,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:28:01,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-14 12:28:01,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045438878] [2022-12-14 12:28:01,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:28:01,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:28:01,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:28:01,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:28:01,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-12-14 12:28:01,250 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-12-14 12:28:01,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:28:01,386 INFO L93 Difference]: Finished difference Result 197 states and 218 transitions. [2022-12-14 12:28:01,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 12:28:01,386 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-12-14 12:28:01,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:28:01,388 INFO L225 Difference]: With dead ends: 197 [2022-12-14 12:28:01,388 INFO L226 Difference]: Without dead ends: 197 [2022-12-14 12:28:01,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-12-14 12:28:01,389 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 168 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:28:01,389 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.1s Time] [2022-12-14 12:28:01,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-12-14 12:28:01,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 131. [2022-12-14 12:28:01,394 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-12-14 12:28:01,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 188 transitions. [2022-12-14 12:28:01,395 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 188 transitions. Word has length 7 [2022-12-14 12:28:01,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:28:01,395 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 188 transitions. [2022-12-14 12:28:01,395 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-12-14 12:28:01,396 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 188 transitions. [2022-12-14 12:28:01,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 12:28:01,396 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:28:01,396 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:28:01,401 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 12:28:01,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:28:01,598 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-12-14 12:28:01,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:28:01,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1578243616, now seen corresponding path program 1 times [2022-12-14 12:28:01,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:28:01,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005340249] [2022-12-14 12:28:01,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:28:01,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:28:01,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:28:01,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:28:01,742 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:28:01,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005340249] [2022-12-14 12:28:01,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005340249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:28:01,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:28:01,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 12:28:01,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633727711] [2022-12-14 12:28:01,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:28:01,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 12:28:01,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:28:01,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 12:28:01,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 12:28:01,746 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-12-14 12:28:01,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:28:01,837 INFO L93 Difference]: Finished difference Result 190 states and 256 transitions. [2022-12-14 12:28:01,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 12:28:01,837 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-12-14 12:28:01,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:28:01,839 INFO L225 Difference]: With dead ends: 190 [2022-12-14 12:28:01,839 INFO L226 Difference]: Without dead ends: 190 [2022-12-14 12:28:01,839 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-12-14 12:28:01,840 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-12-14 12:28:01,841 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-12-14 12:28:01,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-12-14 12:28:01,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 129. [2022-12-14 12:28:01,848 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-12-14 12:28:01,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 182 transitions. [2022-12-14 12:28:01,849 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 182 transitions. Word has length 8 [2022-12-14 12:28:01,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:28:01,849 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 182 transitions. [2022-12-14 12:28:01,849 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-12-14 12:28:01,850 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 182 transitions. [2022-12-14 12:28:01,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 12:28:01,850 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:28:01,850 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:28:01,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 12:28:01,850 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-12-14 12:28:01,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:28:01,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1578243617, now seen corresponding path program 1 times [2022-12-14 12:28:01,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:28:01,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967386953] [2022-12-14 12:28:01,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:28:01,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:28:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:28:01,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:28:01,918 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:28:01,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967386953] [2022-12-14 12:28:01,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967386953] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:28:01,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:28:01,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 12:28:01,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189827095] [2022-12-14 12:28:01,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:28:01,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 12:28:01,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:28:01,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 12:28:01,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 12:28:01,920 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-12-14 12:28:02,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:28:02,081 INFO L93 Difference]: Finished difference Result 301 states and 386 transitions. [2022-12-14 12:28:02,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 12:28:02,081 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-12-14 12:28:02,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:28:02,083 INFO L225 Difference]: With dead ends: 301 [2022-12-14 12:28:02,083 INFO L226 Difference]: Without dead ends: 301 [2022-12-14 12:28:02,083 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-12-14 12:28:02,084 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 198 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:28:02,084 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.1s Time] [2022-12-14 12:28:02,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-12-14 12:28:02,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 132. [2022-12-14 12:28:02,091 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-12-14 12:28:02,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 185 transitions. [2022-12-14 12:28:02,092 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 185 transitions. Word has length 8 [2022-12-14 12:28:02,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:28:02,092 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 185 transitions. [2022-12-14 12:28:02,092 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-12-14 12:28:02,092 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 185 transitions. [2022-12-14 12:28:02,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 12:28:02,092 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:28:02,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:28:02,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 12:28:02,093 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-12-14 12:28:02,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:28:02,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1680676048, now seen corresponding path program 1 times [2022-12-14 12:28:02,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:28:02,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286048539] [2022-12-14 12:28:02,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:28:02,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:28:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:28:02,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:28:02,124 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:28:02,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286048539] [2022-12-14 12:28:02,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286048539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:28:02,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:28:02,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 12:28:02,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459723080] [2022-12-14 12:28:02,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:28:02,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 12:28:02,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:28:02,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 12:28:02,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 12:28:02,126 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-12-14 12:28:02,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:28:02,198 INFO L93 Difference]: Finished difference Result 198 states and 262 transitions. [2022-12-14 12:28:02,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 12:28:02,198 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-12-14 12:28:02,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:28:02,200 INFO L225 Difference]: With dead ends: 198 [2022-12-14 12:28:02,200 INFO L226 Difference]: Without dead ends: 198 [2022-12-14 12:28:02,200 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-12-14 12:28:02,201 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-12-14 12:28:02,201 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-12-14 12:28:02,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-12-14 12:28:02,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 131. [2022-12-14 12:28:02,208 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-12-14 12:28:02,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 182 transitions. [2022-12-14 12:28:02,210 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 182 transitions. Word has length 9 [2022-12-14 12:28:02,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:28:02,210 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 182 transitions. [2022-12-14 12:28:02,210 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-12-14 12:28:02,210 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 182 transitions. [2022-12-14 12:28:02,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 12:28:02,211 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:28:02,211 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:28:02,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 12:28:02,211 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-12-14 12:28:02,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:28:02,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1680676049, now seen corresponding path program 1 times [2022-12-14 12:28:02,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:28:02,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879750308] [2022-12-14 12:28:02,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:28:02,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:28:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:28:02,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:28:02,267 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:28:02,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879750308] [2022-12-14 12:28:02,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879750308] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:28:02,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:28:02,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 12:28:02,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504462754] [2022-12-14 12:28:02,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:28:02,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 12:28:02,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:28:02,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 12:28:02,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 12:28:02,269 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-12-14 12:28:02,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:28:02,340 INFO L93 Difference]: Finished difference Result 199 states and 260 transitions. [2022-12-14 12:28:02,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 12:28:02,340 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-12-14 12:28:02,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:28:02,342 INFO L225 Difference]: With dead ends: 199 [2022-12-14 12:28:02,342 INFO L226 Difference]: Without dead ends: 199 [2022-12-14 12:28:02,342 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-12-14 12:28:02,343 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-12-14 12:28:02,343 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-12-14 12:28:02,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-12-14 12:28:02,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 130. [2022-12-14 12:28:02,349 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-12-14 12:28:02,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 179 transitions. [2022-12-14 12:28:02,350 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 179 transitions. Word has length 9 [2022-12-14 12:28:02,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:28:02,350 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 179 transitions. [2022-12-14 12:28:02,350 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-12-14 12:28:02,350 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 179 transitions. [2022-12-14 12:28:02,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 12:28:02,351 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:28:02,351 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:28:02,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 12:28:02,351 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-12-14 12:28:02,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:28:02,352 INFO L85 PathProgramCache]: Analyzing trace with hash 222197449, now seen corresponding path program 1 times [2022-12-14 12:28:02,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:28:02,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553315126] [2022-12-14 12:28:02,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:28:02,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:28:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:28:02,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:28:02,439 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:28:02,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553315126] [2022-12-14 12:28:02,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553315126] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:28:02,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712495187] [2022-12-14 12:28:02,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:28:02,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:28:02,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:28:02,441 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:28:02,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 12:28:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:28:02,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 12:28:02,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:28:02,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:28:02,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:28:02,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:28:02,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712495187] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:28:02,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1680986724] [2022-12-14 12:28:02,564 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-12-14 12:28:02,564 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:28:02,564 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 12:28:02,564 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 12:28:02,564 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 12:28:02,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:02,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:02,584 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-12-14 12:28:02,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:02,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:02,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:02,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:02,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:02,646 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-12-14 12:28:02,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:02,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:02,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:02,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:02,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:02,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:02,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:02,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:02,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:02,717 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-12-14 12:28:02,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:02,782 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-12-14 12:28:02,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:02,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:02,803 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-12-14 12:28:02,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:02,818 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-12-14 12:28:03,016 INFO L321 Elim1Store]: treesize reduction 138, result has 17.9 percent of original size [2022-12-14 12:28:03,016 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-12-14 12:28:03,425 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:28:03,425 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:28:03,451 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-12-14 12:28:03,452 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-12-14 12:28:03,485 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:28:03,486 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:28:03,509 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-12-14 12:28:03,510 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-12-14 12:28:03,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:03,546 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-12-14 12:28:03,547 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-12-14 12:28:03,638 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-12-14 12:28:03,648 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-12-14 12:28:03,669 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-12-14 12:28:03,678 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-12-14 12:28:03,689 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-12-14 12:28:03,734 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-12-14 12:28:03,741 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-12-14 12:28:03,755 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 12:28:04,701 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-12-14 12:28:04,701 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 12:28:04,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:28:04,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-14 12:28:04,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035416113] [2022-12-14 12:28:04,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:28:04,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 12:28:04,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:28:04,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 12:28:04,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2022-12-14 12:28:04,703 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-12-14 12:28:04,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:28:04,925 INFO L93 Difference]: Finished difference Result 309 states and 386 transitions. [2022-12-14 12:28:04,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 12:28:04,925 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-12-14 12:28:04,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:28:04,926 INFO L225 Difference]: With dead ends: 309 [2022-12-14 12:28:04,926 INFO L226 Difference]: Without dead ends: 309 [2022-12-14 12:28:04,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2022-12-14 12:28:04,926 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 196 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:28:04,927 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.2s Time] [2022-12-14 12:28:04,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-12-14 12:28:04,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 148. [2022-12-14 12:28:04,930 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-12-14 12:28:04,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 197 transitions. [2022-12-14 12:28:04,930 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 197 transitions. Word has length 11 [2022-12-14 12:28:04,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:28:04,931 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 197 transitions. [2022-12-14 12:28:04,931 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-12-14 12:28:04,931 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 197 transitions. [2022-12-14 12:28:04,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 12:28:04,931 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:28:04,931 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1] [2022-12-14 12:28:04,936 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-14 12:28:05,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:28:05,134 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-12-14 12:28:05,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:28:05,136 INFO L85 PathProgramCache]: Analyzing trace with hash -796510067, now seen corresponding path program 2 times [2022-12-14 12:28:05,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:28:05,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082277267] [2022-12-14 12:28:05,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:28:05,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:28:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:28:05,209 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 12:28:05,210 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:28:05,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082277267] [2022-12-14 12:28:05,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082277267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:28:05,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:28:05,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 12:28:05,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749677111] [2022-12-14 12:28:05,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:28:05,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 12:28:05,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:28:05,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 12:28:05,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 12:28:05,212 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-12-14 12:28:05,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:28:05,285 INFO L93 Difference]: Finished difference Result 207 states and 269 transitions. [2022-12-14 12:28:05,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 12:28:05,285 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-12-14 12:28:05,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:28:05,286 INFO L225 Difference]: With dead ends: 207 [2022-12-14 12:28:05,286 INFO L226 Difference]: Without dead ends: 207 [2022-12-14 12:28:05,287 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-12-14 12:28:05,287 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-12-14 12:28:05,288 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-12-14 12:28:05,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-12-14 12:28:05,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 176. [2022-12-14 12:28:05,292 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-12-14 12:28:05,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 243 transitions. [2022-12-14 12:28:05,292 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 243 transitions. Word has length 15 [2022-12-14 12:28:05,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:28:05,293 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 243 transitions. [2022-12-14 12:28:05,293 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-12-14 12:28:05,293 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 243 transitions. [2022-12-14 12:28:05,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 12:28:05,294 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:28:05,294 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:28:05,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 12:28:05,294 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-12-14 12:28:05,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:28:05,294 INFO L85 PathProgramCache]: Analyzing trace with hash -704792631, now seen corresponding path program 2 times [2022-12-14 12:28:05,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:28:05,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533934895] [2022-12-14 12:28:05,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:28:05,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:28:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:28:05,566 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 12:28:05,567 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:28:05,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533934895] [2022-12-14 12:28:05,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533934895] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:28:05,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158822113] [2022-12-14 12:28:05,567 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:28:05,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:28:05,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:28:05,568 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:28:05,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 12:28:05,642 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 12:28:05,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:28:05,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-14 12:28:05,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:28:05,653 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-12-14 12:28:05,657 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-12-14 12:28:05,684 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 12:28:05,684 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-12-14 12:28:05,688 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-12-14 12:28:05,714 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 12:28:05,714 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-12-14 12:28:05,720 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-12-14 12:28:05,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:05,774 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-12-14 12:28:05,785 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-12-14 12:28:05,785 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-12-14 12:28:05,798 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 12:28:05,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:28:10,370 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 12:28:10,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158822113] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:28:10,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1273464864] [2022-12-14 12:28:10,372 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-12-14 12:28:10,372 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:28:10,372 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 12:28:10,372 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 12:28:10,372 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 12:28:10,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:10,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:10,386 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-12-14 12:28:10,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:10,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:10,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:10,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:10,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:10,438 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-12-14 12:28:10,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:10,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:10,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:10,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:10,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:10,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:10,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:10,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:10,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:10,514 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-12-14 12:28:10,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:10,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:10,581 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-12-14 12:28:10,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:10,594 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-12-14 12:28:10,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:10,615 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-12-14 12:28:10,818 INFO L321 Elim1Store]: treesize reduction 138, result has 17.9 percent of original size [2022-12-14 12:28:10,818 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-12-14 12:28:11,121 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:28:11,154 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-12-14 12:28:11,155 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-12-14 12:28:11,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:11,203 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-12-14 12:28:11,204 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-12-14 12:28:11,220 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:28:11,253 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-12-14 12:28:11,253 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-12-14 12:28:11,351 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-12-14 12:28:11,358 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-12-14 12:28:11,388 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-12-14 12:28:11,401 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-12-14 12:28:11,411 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-12-14 12:28:11,479 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-12-14 12:28:11,488 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-12-14 12:28:11,495 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 12:28:12,431 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-12-14 12:28:12,432 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 12:28:12,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:28:12,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-14 12:28:12,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583047705] [2022-12-14 12:28:12,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:28:12,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 12:28:12,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:28:12,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 12:28:12,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-12-14 12:28:12,433 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-12-14 12:28:12,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:28:12,741 INFO L93 Difference]: Finished difference Result 239 states and 298 transitions. [2022-12-14 12:28:12,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 12:28:12,742 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-12-14 12:28:12,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:28:12,743 INFO L225 Difference]: With dead ends: 239 [2022-12-14 12:28:12,743 INFO L226 Difference]: Without dead ends: 239 [2022-12-14 12:28:12,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2022-12-14 12:28:12,745 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 309 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:28:12,745 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.2s Time] [2022-12-14 12:28:12,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-12-14 12:28:12,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 174. [2022-12-14 12:28:12,748 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-12-14 12:28:12,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 237 transitions. [2022-12-14 12:28:12,749 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 237 transitions. Word has length 17 [2022-12-14 12:28:12,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:28:12,749 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 237 transitions. [2022-12-14 12:28:12,749 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-12-14 12:28:12,749 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 237 transitions. [2022-12-14 12:28:12,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 12:28:12,750 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:28:12,750 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2022-12-14 12:28:12,755 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 12:28:12,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 12:28:12,951 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-12-14 12:28:12,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:28:12,951 INFO L85 PathProgramCache]: Analyzing trace with hash 867387163, now seen corresponding path program 1 times [2022-12-14 12:28:12,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:28:12,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422010983] [2022-12-14 12:28:12,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:28:12,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:28:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:28:12,994 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 12:28:12,994 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:28:12,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422010983] [2022-12-14 12:28:12,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422010983] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:28:12,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:28:12,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 12:28:12,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456991107] [2022-12-14 12:28:12,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:28:12,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 12:28:12,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:28:12,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 12:28:12,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 12:28:12,996 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-12-14 12:28:13,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:28:13,061 INFO L93 Difference]: Finished difference Result 201 states and 252 transitions. [2022-12-14 12:28:13,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 12:28:13,062 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-12-14 12:28:13,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:28:13,063 INFO L225 Difference]: With dead ends: 201 [2022-12-14 12:28:13,063 INFO L226 Difference]: Without dead ends: 201 [2022-12-14 12:28:13,063 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-12-14 12:28:13,064 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 88 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12-14 12:28:13,064 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-12-14 12:28:13,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-12-14 12:28:13,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 163. [2022-12-14 12:28:13,067 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-12-14 12:28:13,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 212 transitions. [2022-12-14 12:28:13,068 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 212 transitions. Word has length 18 [2022-12-14 12:28:13,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:28:13,068 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 212 transitions. [2022-12-14 12:28:13,068 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-12-14 12:28:13,069 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 212 transitions. [2022-12-14 12:28:13,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 12:28:13,069 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:28:13,069 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:28:13,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 12:28:13,070 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-12-14 12:28:13,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:28:13,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1123912815, now seen corresponding path program 1 times [2022-12-14 12:28:13,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:28:13,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854676189] [2022-12-14 12:28:13,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:28:13,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:28:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:28:13,125 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 12:28:13,125 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:28:13,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854676189] [2022-12-14 12:28:13,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854676189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:28:13,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:28:13,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 12:28:13,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648513246] [2022-12-14 12:28:13,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:28:13,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 12:28:13,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:28:13,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 12:28:13,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 12:28:13,126 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-12-14 12:28:13,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:28:13,187 INFO L93 Difference]: Finished difference Result 179 states and 228 transitions. [2022-12-14 12:28:13,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 12:28:13,187 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-12-14 12:28:13,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:28:13,188 INFO L225 Difference]: With dead ends: 179 [2022-12-14 12:28:13,188 INFO L226 Difference]: Without dead ends: 179 [2022-12-14 12:28:13,188 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-12-14 12:28:13,189 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 8 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12-14 12:28:13,189 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-12-14 12:28:13,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-12-14 12:28:13,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 164. [2022-12-14 12:28:13,192 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-12-14 12:28:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 213 transitions. [2022-12-14 12:28:13,193 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 213 transitions. Word has length 19 [2022-12-14 12:28:13,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:28:13,193 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 213 transitions. [2022-12-14 12:28:13,193 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-12-14 12:28:13,194 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 213 transitions. [2022-12-14 12:28:13,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 12:28:13,194 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:28:13,194 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:28:13,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 12:28:13,195 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-12-14 12:28:13,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:28:13,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1123915121, now seen corresponding path program 1 times [2022-12-14 12:28:13,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:28:13,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661534823] [2022-12-14 12:28:13,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:28:13,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:28:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:28:13,254 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 12:28:13,255 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:28:13,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661534823] [2022-12-14 12:28:13,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661534823] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:28:13,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:28:13,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 12:28:13,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766210021] [2022-12-14 12:28:13,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:28:13,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 12:28:13,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:28:13,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 12:28:13,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 12:28:13,256 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-12-14 12:28:13,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:28:13,334 INFO L93 Difference]: Finished difference Result 165 states and 213 transitions. [2022-12-14 12:28:13,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 12:28:13,334 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-12-14 12:28:13,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:28:13,335 INFO L225 Difference]: With dead ends: 165 [2022-12-14 12:28:13,335 INFO L226 Difference]: Without dead ends: 160 [2022-12-14 12:28:13,336 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-12-14 12:28:13,336 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-12-14 12:28:13,337 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-12-14 12:28:13,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-12-14 12:28:13,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2022-12-14 12:28:13,340 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-12-14 12:28:13,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 206 transitions. [2022-12-14 12:28:13,340 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 206 transitions. Word has length 19 [2022-12-14 12:28:13,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:28:13,340 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 206 transitions. [2022-12-14 12:28:13,340 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-12-14 12:28:13,340 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 206 transitions. [2022-12-14 12:28:13,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 12:28:13,341 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:28:13,341 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:28:13,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 12:28:13,341 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-12-14 12:28:13,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:28:13,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1299314341, now seen corresponding path program 1 times [2022-12-14 12:28:13,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:28:13,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355191977] [2022-12-14 12:28:13,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:28:13,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:28:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:28:13,387 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 12:28:13,387 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:28:13,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355191977] [2022-12-14 12:28:13,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355191977] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:28:13,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:28:13,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 12:28:13,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010962460] [2022-12-14 12:28:13,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:28:13,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 12:28:13,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:28:13,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 12:28:13,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 12:28:13,388 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-12-14 12:28:13,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:28:13,454 INFO L93 Difference]: Finished difference Result 180 states and 228 transitions. [2022-12-14 12:28:13,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 12:28:13,454 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-12-14 12:28:13,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:28:13,455 INFO L225 Difference]: With dead ends: 180 [2022-12-14 12:28:13,455 INFO L226 Difference]: Without dead ends: 180 [2022-12-14 12:28:13,456 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-12-14 12:28:13,456 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 162 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12-14 12:28:13,456 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-12-14 12:28:13,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-12-14 12:28:13,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 157. [2022-12-14 12:28:13,459 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-12-14 12:28:13,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 203 transitions. [2022-12-14 12:28:13,460 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 203 transitions. Word has length 19 [2022-12-14 12:28:13,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:28:13,460 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 203 transitions. [2022-12-14 12:28:13,460 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-12-14 12:28:13,460 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 203 transitions. [2022-12-14 12:28:13,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 12:28:13,461 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:28:13,461 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:28:13,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 12:28:13,461 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-12-14 12:28:13,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:28:13,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1299314342, now seen corresponding path program 1 times [2022-12-14 12:28:13,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:28:13,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025916431] [2022-12-14 12:28:13,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:28:13,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:28:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:28:13,570 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 12:28:13,570 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:28:13,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025916431] [2022-12-14 12:28:13,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025916431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:28:13,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:28:13,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 12:28:13,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770412894] [2022-12-14 12:28:13,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:28:13,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 12:28:13,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:28:13,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 12:28:13,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 12:28:13,572 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-12-14 12:28:13,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:28:13,637 INFO L93 Difference]: Finished difference Result 156 states and 200 transitions. [2022-12-14 12:28:13,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 12:28:13,637 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-12-14 12:28:13,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:28:13,638 INFO L225 Difference]: With dead ends: 156 [2022-12-14 12:28:13,638 INFO L226 Difference]: Without dead ends: 156 [2022-12-14 12:28:13,638 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-12-14 12:28:13,639 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 250 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12-14 12:28:13,639 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-12-14 12:28:13,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-12-14 12:28:13,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2022-12-14 12:28:13,642 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-12-14 12:28:13,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 200 transitions. [2022-12-14 12:28:13,643 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 200 transitions. Word has length 19 [2022-12-14 12:28:13,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:28:13,643 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 200 transitions. [2022-12-14 12:28:13,643 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-12-14 12:28:13,643 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 200 transitions. [2022-12-14 12:28:13,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 12:28:13,644 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:28:13,644 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:28:13,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 12:28:13,644 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-12-14 12:28:13,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:28:13,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1624038956, now seen corresponding path program 1 times [2022-12-14 12:28:13,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:28:13,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243715358] [2022-12-14 12:28:13,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:28:13,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:28:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:28:13,880 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 12:28:13,880 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:28:13,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243715358] [2022-12-14 12:28:13,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243715358] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:28:13,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163662085] [2022-12-14 12:28:13,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:28:13,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:28:13,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:28:13,882 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:28:13,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 12:28:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:28:13,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-14 12:28:13,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:28:13,977 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-12-14 12:28:14,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:14,006 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-12-14 12:28:14,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:14,030 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-12-14 12:28:14,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:14,052 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-12-14 12:28:14,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:14,071 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-12-14 12:28:14,091 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 12:28:14,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:28:16,474 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 12:28:16,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163662085] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:28:16,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1807593977] [2022-12-14 12:28:16,476 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-12-14 12:28:16,476 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:28:16,476 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 12:28:16,476 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 12:28:16,476 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 12:28:16,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:16,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:16,491 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-12-14 12:28:16,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:16,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:16,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:16,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:16,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:16,542 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-12-14 12:28:16,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:16,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:16,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:16,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:16,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:16,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:16,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:16,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:16,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:16,594 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-12-14 12:28:16,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:16,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:16,636 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-12-14 12:28:16,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:16,649 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-12-14 12:28:16,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:16,667 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-12-14 12:28:16,856 INFO L321 Elim1Store]: treesize reduction 138, result has 17.9 percent of original size [2022-12-14 12:28:16,856 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-12-14 12:28:17,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:28:17,169 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-12-14 12:28:17,170 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-12-14 12:28:17,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:17,209 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-12-14 12:28:17,209 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-12-14 12:28:17,230 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:28:17,271 INFO L321 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2022-12-14 12:28:17,271 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-12-14 12:28:17,367 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-12-14 12:28:17,375 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-12-14 12:28:17,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 12:28:17,406 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-12-14 12:28:17,415 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-12-14 12:28:17,448 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-12-14 12:28:17,454 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-12-14 12:28:17,492 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-12-14 12:28:17,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 19 treesize of output 1 [2022-12-14 12:28:17,503 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-12-14 12:28:17,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:17,538 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-12-14 12:28:17,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:17,550 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-12-14 12:28:17,559 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-12-14 12:28:17,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:17,599 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-12-14 12:28:17,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:17,615 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-12-14 12:28:17,631 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-12-14 12:28:17,648 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 12:28:19,338 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5619#(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-12-14 12:28:19,339 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 12:28:19,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:28:19,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-12-14 12:28:19,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208266825] [2022-12-14 12:28:19,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:28:19,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 12:28:19,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:28:19,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 12:28:19,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-12-14 12:28:19,340 INFO L87 Difference]: Start difference. First operand 156 states and 200 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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-12-14 12:28:19,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:28:19,482 INFO L93 Difference]: Finished difference Result 175 states and 217 transitions. [2022-12-14 12:28:19,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 12:28:19,483 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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-12-14 12:28:19,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:28:19,483 INFO L225 Difference]: With dead ends: 175 [2022-12-14 12:28:19,483 INFO L226 Difference]: Without dead ends: 175 [2022-12-14 12:28:19,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2022-12-14 12:28:19,484 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 310 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:28:19,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 50 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:28:19,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-12-14 12:28:19,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 152. [2022-12-14 12:28:19,486 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-12-14 12:28:19,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 192 transitions. [2022-12-14 12:28:19,486 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 192 transitions. Word has length 20 [2022-12-14 12:28:19,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:28:19,486 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 192 transitions. [2022-12-14 12:28:19,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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-12-14 12:28:19,486 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 192 transitions. [2022-12-14 12:28:19,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 12:28:19,487 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:28:19,487 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:28:19,492 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 12:28:19,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 12:28:19,689 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-12-14 12:28:19,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:28:19,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1624038955, now seen corresponding path program 1 times [2022-12-14 12:28:19,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:28:19,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011016263] [2022-12-14 12:28:19,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:28:19,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:28:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:28:19,883 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 12:28:19,883 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:28:19,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011016263] [2022-12-14 12:28:19,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011016263] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:28:19,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52480911] [2022-12-14 12:28:19,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:28:19,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:28:19,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:28:19,885 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:28:19,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 12:28:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:28:19,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-14 12:28:19,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:28:19,974 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-12-14 12:28:19,994 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 12:28:19,994 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-12-14 12:28:20,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:20,023 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-12-14 12:28:20,041 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 12:28:20,041 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-12-14 12:28:20,090 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-12-14 12:28:20,090 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-12-14 12:28:20,161 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 12:28:20,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:28:20,307 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 12:28:20,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52480911] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:28:20,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2031323215] [2022-12-14 12:28:20,309 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-12-14 12:28:20,309 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:28:20,310 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 12:28:20,310 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 12:28:20,310 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 12:28:20,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:20,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:20,321 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-12-14 12:28:20,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:20,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:20,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:20,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:20,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:20,362 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-12-14 12:28:20,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:20,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:20,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:20,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:20,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:20,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:20,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:20,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:20,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:20,403 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-12-14 12:28:20,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:20,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:20,443 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-12-14 12:28:20,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:20,456 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-12-14 12:28:20,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:20,476 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-12-14 12:28:20,647 INFO L321 Elim1Store]: treesize reduction 138, result has 17.9 percent of original size [2022-12-14 12:28:20,647 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-12-14 12:28:20,904 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:28:20,942 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-12-14 12:28:20,942 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-12-14 12:28:20,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:20,976 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-12-14 12:28:20,976 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-12-14 12:28:20,991 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:28:21,023 INFO L321 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2022-12-14 12:28:21,023 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-12-14 12:28:21,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 12:28:21,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 12:28:21,143 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-12-14 12:28:21,153 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-12-14 12:28:21,159 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-12-14 12:28:21,180 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-12-14 12:28:21,187 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-12-14 12:28:21,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 19 treesize of output 1 [2022-12-14 12:28:21,238 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-12-14 12:28:21,244 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-12-14 12:28:21,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:21,278 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-12-14 12:28:21,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:21,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 12:28:21,305 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-12-14 12:28:21,329 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-12-14 12:28:21,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:21,350 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-12-14 12:28:21,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:21,362 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-12-14 12:28:21,379 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 12:28:22,987 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6088#(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-12-14 12:28:22,988 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 12:28:22,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:28:22,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 12 [2022-12-14 12:28:22,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505607877] [2022-12-14 12:28:22,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:28:22,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 12:28:22,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:28:22,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 12:28:22,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2022-12-14 12:28:22,989 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-12-14 12:28:23,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:28:23,098 INFO L93 Difference]: Finished difference Result 173 states and 211 transitions. [2022-12-14 12:28:23,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 12:28:23,099 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-12-14 12:28:23,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:28:23,099 INFO L225 Difference]: With dead ends: 173 [2022-12-14 12:28:23,099 INFO L226 Difference]: Without dead ends: 173 [2022-12-14 12:28:23,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2022-12-14 12:28:23,100 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 377 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:28:23,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 148 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:28:23,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-12-14 12:28:23,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 150. [2022-12-14 12:28:23,102 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-12-14 12:28:23,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 186 transitions. [2022-12-14 12:28:23,102 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 186 transitions. Word has length 20 [2022-12-14 12:28:23,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:28:23,102 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 186 transitions. [2022-12-14 12:28:23,103 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-12-14 12:28:23,103 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 186 transitions. [2022-12-14 12:28:23,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 12:28:23,103 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:28:23,103 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:28:23,107 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 12:28:23,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:28:23,305 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-12-14 12:28:23,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:28:23,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1628487786, now seen corresponding path program 1 times [2022-12-14 12:28:23,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:28:23,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007926389] [2022-12-14 12:28:23,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:28:23,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:28:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:28:23,656 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 12:28:23,656 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:28:23,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007926389] [2022-12-14 12:28:23,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007926389] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:28:23,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817990487] [2022-12-14 12:28:23,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:28:23,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:28:23,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:28:23,658 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:28:23,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 12:28:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:28:23,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-14 12:28:23,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:28:23,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:23,883 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-12-14 12:28:23,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:23,889 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-12-14 12:28:23,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:23,957 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-12-14 12:28:23,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:23,962 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-12-14 12:28:24,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:24,035 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-12-14 12:28:24,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:24,042 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-12-14 12:28:24,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:24,113 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-12-14 12:28:24,114 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-12-14 12:28:24,138 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 12:28:24,138 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-12-14 12:28:24,211 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-12-14 12:28:24,211 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-12-14 12:28:24,231 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 12:28:24,231 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-12-14 12:28:24,297 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 12:28:24,298 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-12-14 12:28:24,321 INFO L321 Elim1Store]: treesize reduction 32, result has 41.8 percent of original size [2022-12-14 12:28:24,321 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-12-14 12:28:24,486 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-12-14 12:28:24,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:24,491 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-12-14 12:28:24,494 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 12:28:24,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:28:24,531 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:28:24,532 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-12-14 12:28:24,536 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:28:24,537 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-12-14 12:28:24,837 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-12-14 12:28:25,451 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-12-14 12:28:27,387 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-12-14 12:28:27,433 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-12-14 12:28:27,530 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-12-14 12:28:27,683 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-12-14 12:28:27,761 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-12-14 12:28:27,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817990487] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:28:27,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [14379796] [2022-12-14 12:28:27,762 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-12-14 12:28:27,763 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:28:27,763 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 12:28:27,763 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 12:28:27,763 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 12:28:27,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:27,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:27,774 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-12-14 12:28:27,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:27,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:27,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:27,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:27,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:27,820 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-12-14 12:28:27,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:27,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:27,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:27,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:27,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:27,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:27,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:27,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:27,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:27,881 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-12-14 12:28:27,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:27,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:27,928 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-12-14 12:28:27,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:27,949 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-12-14 12:28:27,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:27,964 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-12-14 12:28:28,215 INFO L321 Elim1Store]: treesize reduction 138, result has 17.9 percent of original size [2022-12-14 12:28:28,216 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-12-14 12:28:28,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:28,487 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-12-14 12:28:28,488 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-12-14 12:28:28,503 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:28:28,504 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:28:28,539 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-12-14 12:28:28,539 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-12-14 12:28:28,556 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:28:28,557 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:28:28,612 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-12-14 12:28:28,612 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-12-14 12:28:28,703 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-12-14 12:28:28,712 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-12-14 12:28:28,736 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-12-14 12:28:28,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 12:28:28,754 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-12-14 12:28:28,776 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-12-14 12:28:28,789 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-12-14 12:28:28,831 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-12-14 12:28:28,836 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-12-14 12:28:28,845 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-12-14 12:28:28,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:28,874 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-12-14 12:28:28,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 12:28:28,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:28,893 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-12-14 12:28:28,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 12:28:28,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:28,927 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-12-14 12:28:28,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:28,947 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-12-14 12:28:28,997 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 12:28:31,599 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6579#(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-12-14 12:28:31,600 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 12:28:31,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:28:31,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2022-12-14 12:28:31,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870261787] [2022-12-14 12:28:31,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:28:31,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-14 12:28:31,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:28:31,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-14 12:28:31,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1066, Unknown=46, NotChecked=438, Total=1722 [2022-12-14 12:28:31,601 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-12-14 12:28:39,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:28:39,879 INFO L93 Difference]: Finished difference Result 270 states and 321 transitions. [2022-12-14 12:28:39,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 12:28:39,880 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-12-14 12:28:39,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:28:39,881 INFO L225 Difference]: With dead ends: 270 [2022-12-14 12:28:39,881 INFO L226 Difference]: Without dead ends: 270 [2022-12-14 12:28:39,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=314, Invalid=1470, Unknown=46, NotChecked=522, Total=2352 [2022-12-14 12:28:39,883 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 116 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 42 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 558 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 12:28:39,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 670 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 407 Invalid, 4 Unknown, 558 Unchecked, 1.3s Time] [2022-12-14 12:28:39,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-12-14 12:28:39,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 201. [2022-12-14 12:28:39,887 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-12-14 12:28:39,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 240 transitions. [2022-12-14 12:28:39,887 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 240 transitions. Word has length 22 [2022-12-14 12:28:39,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:28:39,887 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 240 transitions. [2022-12-14 12:28:39,887 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-12-14 12:28:39,888 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 240 transitions. [2022-12-14 12:28:39,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 12:28:39,888 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:28:39,888 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-12-14 12:28:39,893 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 12:28:40,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 12:28:40,090 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-12-14 12:28:40,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:28:40,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1361321693, now seen corresponding path program 1 times [2022-12-14 12:28:40,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:28:40,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598129378] [2022-12-14 12:28:40,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:28:40,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:28:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:28:40,183 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 12:28:40,183 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:28:40,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598129378] [2022-12-14 12:28:40,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598129378] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:28:40,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:28:40,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 12:28:40,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340087593] [2022-12-14 12:28:40,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:28:40,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 12:28:40,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:28:40,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 12:28:40,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 12:28:40,185 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-12-14 12:28:40,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:28:40,273 INFO L93 Difference]: Finished difference Result 253 states and 292 transitions. [2022-12-14 12:28:40,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 12:28:40,274 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-12-14 12:28:40,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:28:40,275 INFO L225 Difference]: With dead ends: 253 [2022-12-14 12:28:40,275 INFO L226 Difference]: Without dead ends: 253 [2022-12-14 12:28:40,275 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-12-14 12:28:40,276 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-12-14 12:28:40,276 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-12-14 12:28:40,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-12-14 12:28:40,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 201. [2022-12-14 12:28:40,279 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-12-14 12:28:40,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 240 transitions. [2022-12-14 12:28:40,280 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 240 transitions. Word has length 39 [2022-12-14 12:28:40,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:28:40,280 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 240 transitions. [2022-12-14 12:28:40,280 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-12-14 12:28:40,281 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 240 transitions. [2022-12-14 12:28:40,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 12:28:40,281 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:28:40,281 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-12-14 12:28:40,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-14 12:28:40,281 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-12-14 12:28:40,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:28:40,282 INFO L85 PathProgramCache]: Analyzing trace with hash -743985939, now seen corresponding path program 1 times [2022-12-14 12:28:40,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:28:40,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173593638] [2022-12-14 12:28:40,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:28:40,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:28:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:28:40,409 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 12:28:40,409 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:28:40,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173593638] [2022-12-14 12:28:40,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173593638] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:28:40,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:28:40,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 12:28:40,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079183291] [2022-12-14 12:28:40,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:28:40,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 12:28:40,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:28:40,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 12:28:40,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 12:28:40,411 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-12-14 12:28:40,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:28:40,537 INFO L93 Difference]: Finished difference Result 227 states and 273 transitions. [2022-12-14 12:28:40,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:28:40,537 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-12-14 12:28:40,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:28:40,539 INFO L225 Difference]: With dead ends: 227 [2022-12-14 12:28:40,539 INFO L226 Difference]: Without dead ends: 227 [2022-12-14 12:28:40,539 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-12-14 12:28:40,540 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-12-14 12:28:40,540 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-12-14 12:28:40,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-12-14 12:28:40,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 218. [2022-12-14 12:28:40,545 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-12-14 12:28:40,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 269 transitions. [2022-12-14 12:28:40,545 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 269 transitions. Word has length 40 [2022-12-14 12:28:40,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:28:40,546 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 269 transitions. [2022-12-14 12:28:40,546 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-12-14 12:28:40,546 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 269 transitions. [2022-12-14 12:28:40,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 12:28:40,546 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:28:40,547 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-12-14 12:28:40,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-14 12:28:40,547 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-12-14 12:28:40,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:28:40,547 INFO L85 PathProgramCache]: Analyzing trace with hash -743983633, now seen corresponding path program 1 times [2022-12-14 12:28:40,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:28:40,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996763690] [2022-12-14 12:28:40,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:28:40,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:28:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:28:40,728 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-14 12:28:40,728 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:28:40,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996763690] [2022-12-14 12:28:40,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996763690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:28:40,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:28:40,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 12:28:40,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549028666] [2022-12-14 12:28:40,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:28:40,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 12:28:40,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:28:40,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 12:28:40,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 12:28:40,729 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-12-14 12:28:40,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:28:40,873 INFO L93 Difference]: Finished difference Result 319 states and 387 transitions. [2022-12-14 12:28:40,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:28:40,874 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-12-14 12:28:40,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:28:40,876 INFO L225 Difference]: With dead ends: 319 [2022-12-14 12:28:40,876 INFO L226 Difference]: Without dead ends: 319 [2022-12-14 12:28:40,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-12-14 12:28:40,877 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-12-14 12:28:40,877 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-12-14 12:28:40,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-12-14 12:28:40,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 247. [2022-12-14 12:28:40,881 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-12-14 12:28:40,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 311 transitions. [2022-12-14 12:28:40,882 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 311 transitions. Word has length 40 [2022-12-14 12:28:40,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:28:40,882 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 311 transitions. [2022-12-14 12:28:40,882 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-12-14 12:28:40,882 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 311 transitions. [2022-12-14 12:28:40,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 12:28:40,882 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:28:40,883 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-12-14 12:28:40,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-14 12:28:40,883 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-12-14 12:28:40,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:28:40,883 INFO L85 PathProgramCache]: Analyzing trace with hash -748701660, now seen corresponding path program 1 times [2022-12-14 12:28:40,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:28:40,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155554119] [2022-12-14 12:28:40,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:28:40,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:28:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:28:41,043 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-14 12:28:41,043 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:28:41,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155554119] [2022-12-14 12:28:41,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155554119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:28:41,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:28:41,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 12:28:41,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435055774] [2022-12-14 12:28:41,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:28:41,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:28:41,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:28:41,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:28:41,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:28:41,045 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-12-14 12:28:41,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:28:41,299 INFO L93 Difference]: Finished difference Result 397 states and 480 transitions. [2022-12-14 12:28:41,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 12:28:41,299 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-12-14 12:28:41,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:28:41,300 INFO L225 Difference]: With dead ends: 397 [2022-12-14 12:28:41,300 INFO L226 Difference]: Without dead ends: 397 [2022-12-14 12:28:41,300 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-12-14 12:28:41,301 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.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:28:41,301 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.2s Time] [2022-12-14 12:28:41,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-12-14 12:28:41,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 252. [2022-12-14 12:28:41,304 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-12-14 12:28:41,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 320 transitions. [2022-12-14 12:28:41,305 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 320 transitions. Word has length 40 [2022-12-14 12:28:41,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:28:41,305 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 320 transitions. [2022-12-14 12:28:41,305 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-12-14 12:28:41,305 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 320 transitions. [2022-12-14 12:28:41,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 12:28:41,305 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:28:41,306 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-12-14 12:28:41,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-14 12:28:41,306 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-12-14 12:28:41,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:28:41,306 INFO L85 PathProgramCache]: Analyzing trace with hash -748701659, now seen corresponding path program 1 times [2022-12-14 12:28:41,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:28:41,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977857799] [2022-12-14 12:28:41,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:28:41,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:28:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:28:41,450 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:28:41,450 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:28:41,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977857799] [2022-12-14 12:28:41,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977857799] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:28:41,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786266924] [2022-12-14 12:28:41,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:28:41,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:28:41,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:28:41,452 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:28:41,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 12:28:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:28:41,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 12:28:41,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:28:41,598 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:28:41,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:28:41,660 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:28:41,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786266924] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:28:41,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [649023834] [2022-12-14 12:28:41,662 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2022-12-14 12:28:41,663 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:28:41,663 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 12:28:41,663 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 12:28:41,663 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 12:28:41,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:41,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:41,682 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-12-14 12:28:41,839 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-12-14 12:28:41,845 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-12-14 12:28:41,879 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 12:28:41,882 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 12:28:41,883 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 12:28:41,911 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 12:28:41,912 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-12-14 12:28:41,924 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-12-14 12:28:41,944 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-12-14 12:28:41,952 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-12-14 12:28:41,962 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-12-14 12:28:42,043 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 12:28:42,044 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 12:28:42,046 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 12:28:42,125 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-12-14 12:28:42,125 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-12-14 12:28:42,178 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-12-14 12:28:42,178 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-12-14 12:28:42,348 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:28:42,358 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 12:28:42,358 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-12-14 12:28:42,371 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:28:42,381 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-12-14 12:28:42,381 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-12-14 12:28:42,425 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-12-14 12:28:42,500 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-12-14 12:28:42,514 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-12-14 12:28:42,523 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-12-14 12:28:42,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:42,557 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-12-14 12:28:42,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:42,566 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-12-14 12:28:42,576 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-12-14 12:28:42,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 12:28:42,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:42,612 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-12-14 12:28:42,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:42,624 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-12-14 12:28:42,673 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-12-14 12:28:42,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:42,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:42,687 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:28:42,695 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 12:28:42,695 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-12-14 12:28:42,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:42,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:42,706 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:28:42,715 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-12-14 12:28:42,715 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-12-14 12:28:42,939 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-12-14 12:28:42,945 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-12-14 12:28:42,967 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-12-14 12:28:42,972 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-12-14 12:28:42,987 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-12-14 12:28:42,993 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-12-14 12:28:42,999 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-12-14 12:28:43,046 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-12-14 12:28:43,057 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-12-14 12:28:43,064 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-12-14 12:28:43,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:43,083 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-12-14 12:28:43,092 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-12-14 12:28:43,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:43,105 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-12-14 12:28:43,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:43,132 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-12-14 12:28:43,140 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-12-14 12:28:43,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:43,147 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-12-14 12:28:43,190 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-12-14 12:28:43,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:43,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:43,201 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:28:43,209 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-12-14 12:28:43,209 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-12-14 12:28:43,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:43,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:43,228 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:28:43,238 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 12:28:43,238 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-12-14 12:28:43,439 INFO L321 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2022-12-14 12:28:43,439 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-12-14 12:28:43,457 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 12:28:43,457 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-12-14 12:28:43,696 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-12-14 12:28:43,703 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-12-14 12:28:43,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 12:28:43,736 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-12-14 12:28:43,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 12:28:43,780 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-12-14 12:28:43,788 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-12-14 12:28:43,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-12-14 12:28:43,844 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-12-14 12:28:43,862 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-12-14 12:28:43,885 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-12-14 12:28:43,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:43,896 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-12-14 12:28:43,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:43,911 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-12-14 12:28:43,934 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-12-14 12:28:43,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:43,941 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-12-14 12:28:43,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:43,950 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-12-14 12:28:44,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:44,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:44,004 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:28:44,013 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-12-14 12:28:44,013 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-12-14 12:28:44,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:44,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:44,028 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:28:44,042 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 12:28:44,042 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-12-14 12:28:44,053 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-12-14 12:28:44,195 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-12-14 12:28:44,200 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-12-14 12:28:44,233 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 12:28:46,611 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9493#(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-12-14 12:28:46,611 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 12:28:46,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:28:46,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-12-14 12:28:46,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863844832] [2022-12-14 12:28:46,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:28:46,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 12:28:46,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:28:46,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 12:28:46,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2022-12-14 12:28:46,613 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-12-14 12:28:47,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:28:47,191 INFO L93 Difference]: Finished difference Result 703 states and 900 transitions. [2022-12-14 12:28:47,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 12:28:47,191 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-12-14 12:28:47,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:28:47,195 INFO L225 Difference]: With dead ends: 703 [2022-12-14 12:28:47,195 INFO L226 Difference]: Without dead ends: 703 [2022-12-14 12:28:47,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 84 SyntacticMatches, 15 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=355, Invalid=1537, Unknown=0, NotChecked=0, Total=1892 [2022-12-14 12:28:47,196 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 388 mSDsluCounter, 1268 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 12:28:47,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 1525 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 12:28:47,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2022-12-14 12:28:47,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 303. [2022-12-14 12:28:47,201 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-12-14 12:28:47,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 397 transitions. [2022-12-14 12:28:47,202 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 397 transitions. Word has length 40 [2022-12-14 12:28:47,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:28:47,202 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 397 transitions. [2022-12-14 12:28:47,202 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-12-14 12:28:47,202 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 397 transitions. [2022-12-14 12:28:47,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 12:28:47,202 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:28:47,202 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-12-14 12:28:47,208 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 12:28:47,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-14 12:28:47,403 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-12-14 12:28:47,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:28:47,403 INFO L85 PathProgramCache]: Analyzing trace with hash -627202339, now seen corresponding path program 2 times [2022-12-14 12:28:47,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:28:47,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262322769] [2022-12-14 12:28:47,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:28:47,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:28:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:28:47,647 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 12:28:47,647 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:28:47,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262322769] [2022-12-14 12:28:47,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262322769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:28:47,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:28:47,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 12:28:47,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152094783] [2022-12-14 12:28:47,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:28:47,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:28:47,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:28:47,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:28:47,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:28:47,649 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-12-14 12:28:47,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:28:47,844 INFO L93 Difference]: Finished difference Result 386 states and 498 transitions. [2022-12-14 12:28:47,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 12:28:47,844 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-12-14 12:28:47,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:28:47,846 INFO L225 Difference]: With dead ends: 386 [2022-12-14 12:28:47,846 INFO L226 Difference]: Without dead ends: 386 [2022-12-14 12:28:47,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-12-14 12:28:47,847 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 384 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:28:47,847 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.1s Time] [2022-12-14 12:28:47,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-12-14 12:28:47,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 305. [2022-12-14 12:28:47,852 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-12-14 12:28:47,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 397 transitions. [2022-12-14 12:28:47,853 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 397 transitions. Word has length 40 [2022-12-14 12:28:47,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:28:47,854 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 397 transitions. [2022-12-14 12:28:47,854 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-12-14 12:28:47,854 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 397 transitions. [2022-12-14 12:28:47,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 12:28:47,854 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:28:47,854 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-12-14 12:28:47,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-14 12:28:47,855 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-12-14 12:28:47,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:28:47,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1445907787, now seen corresponding path program 1 times [2022-12-14 12:28:47,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:28:47,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821213436] [2022-12-14 12:28:47,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:28:47,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:28:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:28:48,355 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 12:28:48,355 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:28:48,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821213436] [2022-12-14 12:28:48,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821213436] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:28:48,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124046708] [2022-12-14 12:28:48,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:28:48,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:28:48,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:28:48,357 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:28:48,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4aeec7bf-b4a2-463d-9d88-b353d0622b18/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 12:28:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:28:48,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-14 12:28:48,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:28:48,484 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-12-14 12:28:48,509 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 12:28:48,510 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-12-14 12:28:48,575 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-12-14 12:28:48,676 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 13 treesize of output 9 [2022-12-14 12:28:48,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 12:28:48,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 12:28:48,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 12:28:48,830 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 28 treesize of output 30 [2022-12-14 12:28:48,835 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-12-14 12:28:49,053 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:28:49,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:28:49,057 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-14 12:28:49,058 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 78 treesize of output 42 [2022-12-14 12:28:49,063 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 12:28:49,064 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-12-14 12:28:49,067 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-14 12:28:49,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:28:49,341 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:28:49,341 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-12-14 12:40:24,380 WARN L233 SmtUtils]: Spent 11.46m 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)