./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a13c396f-9da5-40a6-bed3-69934c130c27/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a13c396f-9da5-40a6-bed3-69934c130c27/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_a13c396f-9da5-40a6-bed3-69934c130c27/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a13c396f-9da5-40a6-bed3-69934c130c27/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a13c396f-9da5-40a6-bed3-69934c130c27/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_a13c396f-9da5-40a6-bed3-69934c130c27/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 e174a1790a7df4dcba920aa7097618d66c8703aa13de1aa6af1a2c5f7cb0971c --- 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 14:13:08,547 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 14:13:08,549 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 14:13:08,566 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 14:13:08,566 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 14:13:08,567 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 14:13:08,568 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 14:13:08,570 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 14:13:08,571 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 14:13:08,572 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 14:13:08,573 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 14:13:08,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 14:13:08,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 14:13:08,575 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 14:13:08,576 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 14:13:08,577 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 14:13:08,578 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 14:13:08,579 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 14:13:08,580 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 14:13:08,582 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 14:13:08,583 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 14:13:08,584 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 14:13:08,585 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 14:13:08,586 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 14:13:08,589 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 14:13:08,589 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 14:13:08,590 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 14:13:08,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 14:13:08,591 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 14:13:08,592 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 14:13:08,592 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 14:13:08,593 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 14:13:08,594 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 14:13:08,594 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 14:13:08,595 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 14:13:08,595 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 14:13:08,596 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 14:13:08,596 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 14:13:08,596 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 14:13:08,597 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 14:13:08,597 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 14:13:08,598 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a13c396f-9da5-40a6-bed3-69934c130c27/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-12-14 14:13:08,619 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 14:13:08,619 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 14:13:08,619 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 14:13:08,619 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 14:13:08,620 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 14:13:08,620 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 14:13:08,620 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 14:13:08,620 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 14:13:08,621 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 14:13:08,621 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 14:13:08,621 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 14:13:08,621 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 14:13:08,621 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 14:13:08,621 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 14:13:08,622 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 14:13:08,622 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 14:13:08,622 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 14:13:08,622 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 14:13:08,623 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 14:13:08,623 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 14:13:08,623 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 14:13:08,623 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 14:13:08,623 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 14:13:08,623 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 14:13:08,624 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 14:13:08,624 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 14:13:08,624 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 14:13:08,624 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 14:13:08,624 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 14:13:08,624 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 14:13:08,624 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 14:13:08,625 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 14:13:08,625 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 14:13:08,625 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 14:13:08,625 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 14:13:08,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 14:13:08,625 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 14:13:08,626 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 14:13:08,626 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 14:13:08,626 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 14:13:08,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 14:13:08,626 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 14:13:08,626 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_a13c396f-9da5-40a6-bed3-69934c130c27/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_a13c396f-9da5-40a6-bed3-69934c130c27/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 -> e174a1790a7df4dcba920aa7097618d66c8703aa13de1aa6af1a2c5f7cb0971c [2022-12-14 14:13:08,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 14:13:08,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 14:13:08,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 14:13:08,821 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 14:13:08,822 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 14:13:08,823 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a13c396f-9da5-40a6-bed3-69934c130c27/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2022-12-14 14:13:11,459 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 14:13:11,607 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 14:13:11,608 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a13c396f-9da5-40a6-bed3-69934c130c27/sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2022-12-14 14:13:11,615 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a13c396f-9da5-40a6-bed3-69934c130c27/bin/utaipan-gh47qXpMRh/data/f9aa26c84/d6acafe4ca114c44af5bc59016d84261/FLAG66eceb513 [2022-12-14 14:13:11,626 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a13c396f-9da5-40a6-bed3-69934c130c27/bin/utaipan-gh47qXpMRh/data/f9aa26c84/d6acafe4ca114c44af5bc59016d84261 [2022-12-14 14:13:11,628 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 14:13:11,629 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 14:13:11,630 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 14:13:11,630 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 14:13:11,633 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 14:13:11,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:13:11" (1/1) ... [2022-12-14 14:13:11,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fb43f65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:13:11, skipping insertion in model container [2022-12-14 14:13:11,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:13:11" (1/1) ... [2022-12-14 14:13:11,639 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 14:13:11,664 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 14:13:11,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 14:13:11,860 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 14:13:11,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 14:13:11,909 INFO L208 MainTranslator]: Completed translation [2022-12-14 14:13:11,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:13:11 WrapperNode [2022-12-14 14:13:11,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 14:13:11,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 14:13:11,910 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 14:13:11,911 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 14:13:11,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:13:11" (1/1) ... [2022-12-14 14:13:11,926 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:13:11" (1/1) ... [2022-12-14 14:13:11,943 INFO L138 Inliner]: procedures = 123, calls = 63, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 216 [2022-12-14 14:13:11,943 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 14:13:11,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 14:13:11,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 14:13:11,944 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 14:13:11,950 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:13:11" (1/1) ... [2022-12-14 14:13:11,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:13:11" (1/1) ... [2022-12-14 14:13:11,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:13:11" (1/1) ... [2022-12-14 14:13:11,953 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:13:11" (1/1) ... [2022-12-14 14:13:11,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:13:11" (1/1) ... [2022-12-14 14:13:11,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:13:11" (1/1) ... [2022-12-14 14:13:11,964 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:13:11" (1/1) ... [2022-12-14 14:13:11,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:13:11" (1/1) ... [2022-12-14 14:13:11,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 14:13:11,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 14:13:11,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 14:13:11,968 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 14:13:11,968 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:13:11" (1/1) ... [2022-12-14 14:13:11,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 14:13:11,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a13c396f-9da5-40a6-bed3-69934c130c27/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:13:11,995 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a13c396f-9da5-40a6-bed3-69934c130c27/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 14:13:11,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a13c396f-9da5-40a6-bed3-69934c130c27/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 14:13:12,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 14:13:12,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 14:13:12,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 14:13:12,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 14:13:12,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 14:13:12,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 14:13:12,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 14:13:12,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 14:13:12,137 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 14:13:12,139 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 14:13:12,559 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 14:13:12,617 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 14:13:12,617 INFO L300 CfgBuilder]: Removed 7 assume(true) statements. [2022-12-14 14:13:12,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:13:12 BoogieIcfgContainer [2022-12-14 14:13:12,620 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 14:13:12,623 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 14:13:12,623 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 14:13:12,626 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 14:13:12,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 02:13:11" (1/3) ... [2022-12-14 14:13:12,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2259bffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:13:12, skipping insertion in model container [2022-12-14 14:13:12,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:13:11" (2/3) ... [2022-12-14 14:13:12,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2259bffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:13:12, skipping insertion in model container [2022-12-14 14:13:12,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:13:12" (3/3) ... [2022-12-14 14:13:12,629 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_of_cslls.i [2022-12-14 14:13:12,647 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 14:13:12,648 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 104 error locations. [2022-12-14 14:13:12,689 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 14:13:12,696 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;@739395b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 14:13:12,696 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2022-12-14 14:13:12,701 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 78 states have (on average 2.6025641025641026) internal successors, (203), 182 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 14:13:12,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 14:13:12,707 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:12,707 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 14:13:12,708 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:13:12,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:12,713 INFO L85 PathProgramCache]: Analyzing trace with hash 11660, now seen corresponding path program 1 times [2022-12-14 14:13:12,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:12,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770585569] [2022-12-14 14:13:12,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:12,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:12,894 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 14:13:12,894 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:12,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770585569] [2022-12-14 14:13:12,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770585569] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:13:12,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:13:12,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 14:13:12,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895008754] [2022-12-14 14:13:12,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:13:12,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:13:12,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:12,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:13:12,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:13:12,930 INFO L87 Difference]: Start difference. First operand has 183 states, 78 states have (on average 2.6025641025641026) internal successors, (203), 182 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 14:13:13,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:13,167 INFO L93 Difference]: Finished difference Result 247 states and 267 transitions. [2022-12-14 14:13:13,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:13:13,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-12-14 14:13:13,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:13,177 INFO L225 Difference]: With dead ends: 247 [2022-12-14 14:13:13,177 INFO L226 Difference]: Without dead ends: 245 [2022-12-14 14:13:13,178 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 14:13:13,180 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 172 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:13,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 159 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:13:13,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-12-14 14:13:13,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 173. [2022-12-14 14:13:13,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 78 states have (on average 2.3974358974358974) internal successors, (187), 172 states have internal predecessors, (187), 0 states have call successors, (0), 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 14:13:13,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 187 transitions. [2022-12-14 14:13:13,209 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 187 transitions. Word has length 2 [2022-12-14 14:13:13,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:13,209 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 187 transitions. [2022-12-14 14:13:13,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 14:13:13,209 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 187 transitions. [2022-12-14 14:13:13,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 14:13:13,210 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:13,210 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 14:13:13,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 14:13:13,210 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:13:13,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:13,211 INFO L85 PathProgramCache]: Analyzing trace with hash 11661, now seen corresponding path program 1 times [2022-12-14 14:13:13,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:13,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965008794] [2022-12-14 14:13:13,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:13,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:13,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:13,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 14:13:13,267 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:13,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965008794] [2022-12-14 14:13:13,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965008794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:13:13,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:13:13,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 14:13:13,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66828144] [2022-12-14 14:13:13,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:13:13,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:13:13,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:13,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:13:13,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:13:13,271 INFO L87 Difference]: Start difference. First operand 173 states and 187 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 14:13:13,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:13,448 INFO L93 Difference]: Finished difference Result 287 states and 314 transitions. [2022-12-14 14:13:13,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:13:13,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-12-14 14:13:13,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:13,449 INFO L225 Difference]: With dead ends: 287 [2022-12-14 14:13:13,449 INFO L226 Difference]: Without dead ends: 287 [2022-12-14 14:13:13,449 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 14:13:13,450 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 134 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:13,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 236 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:13:13,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-12-14 14:13:13,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 168. [2022-12-14 14:13:13,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 78 states have (on average 2.3333333333333335) internal successors, (182), 167 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 14:13:13,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2022-12-14 14:13:13,460 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 2 [2022-12-14 14:13:13,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:13,460 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2022-12-14 14:13:13,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 14:13:13,460 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2022-12-14 14:13:13,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 14:13:13,461 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:13,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:13:13,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 14:13:13,461 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:13:13,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:13,461 INFO L85 PathProgramCache]: Analyzing trace with hash -887844972, now seen corresponding path program 1 times [2022-12-14 14:13:13,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:13,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770055723] [2022-12-14 14:13:13,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:13,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:13,614 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 14:13:13,614 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:13,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770055723] [2022-12-14 14:13:13,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770055723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:13:13,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:13:13,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 14:13:13,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480195519] [2022-12-14 14:13:13,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:13:13,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:13:13,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:13,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:13:13,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:13:13,617 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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 14:13:13,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:13,796 INFO L93 Difference]: Finished difference Result 167 states and 181 transitions. [2022-12-14 14:13:13,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:13:13,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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 7 [2022-12-14 14:13:13,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:13,797 INFO L225 Difference]: With dead ends: 167 [2022-12-14 14:13:13,797 INFO L226 Difference]: Without dead ends: 167 [2022-12-14 14:13:13,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 14:13:13,799 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 4 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:13,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 396 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:13:13,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-12-14 14:13:13,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2022-12-14 14:13:13,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 78 states have (on average 2.3205128205128207) internal successors, (181), 166 states have internal predecessors, (181), 0 states have call successors, (0), 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 14:13:13,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 181 transitions. [2022-12-14 14:13:13,806 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 181 transitions. Word has length 7 [2022-12-14 14:13:13,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:13,807 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 181 transitions. [2022-12-14 14:13:13,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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 14:13:13,807 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 181 transitions. [2022-12-14 14:13:13,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 14:13:13,807 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:13,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:13:13,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 14:13:13,808 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:13:13,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:13,809 INFO L85 PathProgramCache]: Analyzing trace with hash -887844971, now seen corresponding path program 1 times [2022-12-14 14:13:13,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:13,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101677540] [2022-12-14 14:13:13,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:13,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:13,979 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 14:13:13,979 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:13,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101677540] [2022-12-14 14:13:13,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101677540] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:13:13,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:13:13,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 14:13:13,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667672910] [2022-12-14 14:13:13,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:13:13,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:13:13,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:13,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:13:13,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:13:13,981 INFO L87 Difference]: Start difference. First operand 167 states and 181 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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 14:13:14,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:14,202 INFO L93 Difference]: Finished difference Result 166 states and 180 transitions. [2022-12-14 14:13:14,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:13:14,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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 7 [2022-12-14 14:13:14,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:14,203 INFO L225 Difference]: With dead ends: 166 [2022-12-14 14:13:14,203 INFO L226 Difference]: Without dead ends: 166 [2022-12-14 14:13:14,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 14:13:14,205 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 2 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:14,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 409 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:13:14,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-12-14 14:13:14,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-12-14 14:13:14,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 78 states have (on average 2.3076923076923075) internal successors, (180), 165 states have internal predecessors, (180), 0 states have call successors, (0), 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 14:13:14,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 180 transitions. [2022-12-14 14:13:14,209 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 180 transitions. Word has length 7 [2022-12-14 14:13:14,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:14,209 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 180 transitions. [2022-12-14 14:13:14,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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 14:13:14,210 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 180 transitions. [2022-12-14 14:13:14,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 14:13:14,210 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:14,210 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:13:14,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 14:13:14,210 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:13:14,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:14,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1371063296, now seen corresponding path program 1 times [2022-12-14 14:13:14,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:14,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660511938] [2022-12-14 14:13:14,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:14,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:14,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:14,318 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 14:13:14,318 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:14,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660511938] [2022-12-14 14:13:14,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660511938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:13:14,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:13:14,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:13:14,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514738215] [2022-12-14 14:13:14,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:13:14,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:13:14,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:14,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:13:14,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:13:14,320 INFO L87 Difference]: Start difference. First operand 166 states and 180 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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 14:13:14,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:14,616 INFO L93 Difference]: Finished difference Result 312 states and 338 transitions. [2022-12-14 14:13:14,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:13:14,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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 10 [2022-12-14 14:13:14,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:14,618 INFO L225 Difference]: With dead ends: 312 [2022-12-14 14:13:14,618 INFO L226 Difference]: Without dead ends: 312 [2022-12-14 14:13:14,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:13:14,619 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 323 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:14,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 180 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 14:13:14,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-12-14 14:13:14,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 162. [2022-12-14 14:13:14,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 78 states have (on average 2.2564102564102564) internal successors, (176), 161 states have internal predecessors, (176), 0 states have call successors, (0), 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 14:13:14,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 176 transitions. [2022-12-14 14:13:14,623 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 176 transitions. Word has length 10 [2022-12-14 14:13:14,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:14,623 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 176 transitions. [2022-12-14 14:13:14,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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 14:13:14,623 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 176 transitions. [2022-12-14 14:13:14,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 14:13:14,624 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:14,624 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:13:14,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 14:13:14,624 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:13:14,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:14,625 INFO L85 PathProgramCache]: Analyzing trace with hash 446710760, now seen corresponding path program 1 times [2022-12-14 14:13:14,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:14,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463688218] [2022-12-14 14:13:14,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:14,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:14,786 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 14:13:14,786 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:14,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463688218] [2022-12-14 14:13:14,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463688218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:13:14,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:13:14,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 14:13:14,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462231042] [2022-12-14 14:13:14,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:13:14,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 14:13:14,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:14,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 14:13:14,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-14 14:13:14,788 INFO L87 Difference]: Start difference. First operand 162 states and 176 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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 14:13:15,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:15,207 INFO L93 Difference]: Finished difference Result 307 states and 339 transitions. [2022-12-14 14:13:15,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 14:13:15,208 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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 11 [2022-12-14 14:13:15,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:15,210 INFO L225 Difference]: With dead ends: 307 [2022-12-14 14:13:15,210 INFO L226 Difference]: Without dead ends: 307 [2022-12-14 14:13:15,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-12-14 14:13:15,211 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 400 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:15,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 681 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 14:13:15,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-12-14 14:13:15,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 166. [2022-12-14 14:13:15,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 82 states have (on average 2.2195121951219514) internal successors, (182), 165 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 14:13:15,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 182 transitions. [2022-12-14 14:13:15,219 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 182 transitions. Word has length 11 [2022-12-14 14:13:15,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:15,219 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 182 transitions. [2022-12-14 14:13:15,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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 14:13:15,219 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 182 transitions. [2022-12-14 14:13:15,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 14:13:15,220 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:15,220 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:13:15,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 14:13:15,220 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:13:15,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:15,221 INFO L85 PathProgramCache]: Analyzing trace with hash 446710761, now seen corresponding path program 1 times [2022-12-14 14:13:15,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:15,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875496059] [2022-12-14 14:13:15,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:15,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:15,472 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 14:13:15,473 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:15,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875496059] [2022-12-14 14:13:15,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875496059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:13:15,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:13:15,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 14:13:15,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110890522] [2022-12-14 14:13:15,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:13:15,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 14:13:15,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:15,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 14:13:15,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-14 14:13:15,475 INFO L87 Difference]: Start difference. First operand 166 states and 182 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 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 14:13:16,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:16,082 INFO L93 Difference]: Finished difference Result 306 states and 338 transitions. [2022-12-14 14:13:16,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 14:13:16,082 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 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 11 [2022-12-14 14:13:16,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:16,083 INFO L225 Difference]: With dead ends: 306 [2022-12-14 14:13:16,083 INFO L226 Difference]: Without dead ends: 306 [2022-12-14 14:13:16,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-12-14 14:13:16,084 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 391 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:16,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 447 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 14:13:16,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-12-14 14:13:16,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 166. [2022-12-14 14:13:16,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 82 states have (on average 2.207317073170732) internal successors, (181), 165 states have internal predecessors, (181), 0 states have call successors, (0), 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 14:13:16,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 181 transitions. [2022-12-14 14:13:16,088 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 181 transitions. Word has length 11 [2022-12-14 14:13:16,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:16,089 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 181 transitions. [2022-12-14 14:13:16,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 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 14:13:16,089 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 181 transitions. [2022-12-14 14:13:16,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 14:13:16,089 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:16,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:13:16,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 14:13:16,090 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:13:16,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:16,090 INFO L85 PathProgramCache]: Analyzing trace with hash 963131682, now seen corresponding path program 1 times [2022-12-14 14:13:16,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:16,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851807371] [2022-12-14 14:13:16,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:16,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:16,121 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 14:13:16,122 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:16,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851807371] [2022-12-14 14:13:16,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851807371] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:13:16,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:13:16,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:13:16,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106289200] [2022-12-14 14:13:16,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:13:16,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:13:16,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:16,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:13:16,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:13:16,124 INFO L87 Difference]: Start difference. First operand 166 states and 181 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 14:13:16,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:16,269 INFO L93 Difference]: Finished difference Result 273 states and 301 transitions. [2022-12-14 14:13:16,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:13:16,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-12-14 14:13:16,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:16,270 INFO L225 Difference]: With dead ends: 273 [2022-12-14 14:13:16,271 INFO L226 Difference]: Without dead ends: 273 [2022-12-14 14:13:16,271 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 14:13:16,271 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 144 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:16,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 262 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:13:16,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-12-14 14:13:16,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 163. [2022-12-14 14:13:16,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 82 states have (on average 2.1707317073170733) internal successors, (178), 162 states have internal predecessors, (178), 0 states have call successors, (0), 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 14:13:16,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 178 transitions. [2022-12-14 14:13:16,275 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 178 transitions. Word has length 12 [2022-12-14 14:13:16,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:16,275 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 178 transitions. [2022-12-14 14:13:16,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 14:13:16,275 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 178 transitions. [2022-12-14 14:13:16,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 14:13:16,276 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:16,276 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:13:16,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 14:13:16,276 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:13:16,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:16,277 INFO L85 PathProgramCache]: Analyzing trace with hash 963131683, now seen corresponding path program 1 times [2022-12-14 14:13:16,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:16,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104601844] [2022-12-14 14:13:16,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:16,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:16,327 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 14:13:16,328 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:16,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104601844] [2022-12-14 14:13:16,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104601844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:13:16,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:13:16,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:13:16,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745147188] [2022-12-14 14:13:16,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:13:16,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:13:16,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:16,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:13:16,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:13:16,329 INFO L87 Difference]: Start difference. First operand 163 states and 178 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 14:13:16,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:16,466 INFO L93 Difference]: Finished difference Result 253 states and 281 transitions. [2022-12-14 14:13:16,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:13:16,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-12-14 14:13:16,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:16,467 INFO L225 Difference]: With dead ends: 253 [2022-12-14 14:13:16,467 INFO L226 Difference]: Without dead ends: 253 [2022-12-14 14:13:16,467 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 14:13:16,468 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 119 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:16,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 273 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:13:16,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-12-14 14:13:16,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 161. [2022-12-14 14:13:16,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 82 states have (on average 2.1463414634146343) internal successors, (176), 160 states have internal predecessors, (176), 0 states have call successors, (0), 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 14:13:16,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 176 transitions. [2022-12-14 14:13:16,471 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 176 transitions. Word has length 12 [2022-12-14 14:13:16,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:16,471 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 176 transitions. [2022-12-14 14:13:16,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 14:13:16,471 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 176 transitions. [2022-12-14 14:13:16,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 14:13:16,472 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:16,472 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:13:16,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 14:13:16,472 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:13:16,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:16,472 INFO L85 PathProgramCache]: Analyzing trace with hash -208860631, now seen corresponding path program 1 times [2022-12-14 14:13:16,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:16,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114708334] [2022-12-14 14:13:16,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:16,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:16,501 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 14:13:16,502 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:16,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114708334] [2022-12-14 14:13:16,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114708334] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:13:16,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:13:16,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:13:16,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590927569] [2022-12-14 14:13:16,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:13:16,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 14:13:16,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:16,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 14:13:16,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:13:16,504 INFO L87 Difference]: Start difference. First operand 161 states and 176 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 14:13:16,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:16,661 INFO L93 Difference]: Finished difference Result 220 states and 242 transitions. [2022-12-14 14:13:16,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:13:16,662 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 13 [2022-12-14 14:13:16,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:16,663 INFO L225 Difference]: With dead ends: 220 [2022-12-14 14:13:16,663 INFO L226 Difference]: Without dead ends: 220 [2022-12-14 14:13:16,663 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 14:13:16,664 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 276 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:16,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 111 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:13:16,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-12-14 14:13:16,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 150. [2022-12-14 14:13:16,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 86 states have (on average 1.9651162790697674) internal successors, (169), 149 states have internal predecessors, (169), 0 states have call successors, (0), 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 14:13:16,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 169 transitions. [2022-12-14 14:13:16,667 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 169 transitions. Word has length 13 [2022-12-14 14:13:16,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:16,667 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 169 transitions. [2022-12-14 14:13:16,667 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 14:13:16,668 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 169 transitions. [2022-12-14 14:13:16,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 14:13:16,668 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:16,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:13:16,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 14:13:16,668 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:13:16,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:16,669 INFO L85 PathProgramCache]: Analyzing trace with hash -208860630, now seen corresponding path program 1 times [2022-12-14 14:13:16,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:16,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524082341] [2022-12-14 14:13:16,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:16,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:16,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:13:16,723 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:16,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524082341] [2022-12-14 14:13:16,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524082341] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:13:16,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:13:16,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:13:16,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357418429] [2022-12-14 14:13:16,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:13:16,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:13:16,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:16,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:13:16,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:13:16,725 INFO L87 Difference]: Start difference. First operand 150 states and 169 transitions. Second operand has 5 states, 4 states have (on average 3.25) 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 14:13:17,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:17,028 INFO L93 Difference]: Finished difference Result 377 states and 425 transitions. [2022-12-14 14:13:17,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 14:13:17,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) 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 13 [2022-12-14 14:13:17,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:17,030 INFO L225 Difference]: With dead ends: 377 [2022-12-14 14:13:17,030 INFO L226 Difference]: Without dead ends: 377 [2022-12-14 14:13:17,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 14:13:17,031 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 461 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:17,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 218 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 14:13:17,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-12-14 14:13:17,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 266. [2022-12-14 14:13:17,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 202 states have (on average 1.9257425742574257) internal successors, (389), 265 states have internal predecessors, (389), 0 states have call successors, (0), 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 14:13:17,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 389 transitions. [2022-12-14 14:13:17,036 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 389 transitions. Word has length 13 [2022-12-14 14:13:17,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:17,037 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 389 transitions. [2022-12-14 14:13:17,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) 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 14:13:17,037 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 389 transitions. [2022-12-14 14:13:17,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 14:13:17,037 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:17,037 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:13:17,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 14:13:17,038 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:13:17,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:17,038 INFO L85 PathProgramCache]: Analyzing trace with hash -2143096939, now seen corresponding path program 1 times [2022-12-14 14:13:17,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:17,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120145517] [2022-12-14 14:13:17,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:17,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:17,131 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 14:13:17,131 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:17,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120145517] [2022-12-14 14:13:17,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120145517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:13:17,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:13:17,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 14:13:17,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772615406] [2022-12-14 14:13:17,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:13:17,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 14:13:17,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:17,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 14:13:17,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-14 14:13:17,133 INFO L87 Difference]: Start difference. First operand 266 states and 389 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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 14:13:17,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:17,561 INFO L93 Difference]: Finished difference Result 662 states and 992 transitions. [2022-12-14 14:13:17,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 14:13:17,561 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-12-14 14:13:17,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:17,562 INFO L225 Difference]: With dead ends: 662 [2022-12-14 14:13:17,563 INFO L226 Difference]: Without dead ends: 662 [2022-12-14 14:13:17,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-12-14 14:13:17,563 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 315 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:17,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 961 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 14:13:17,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2022-12-14 14:13:17,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 265. [2022-12-14 14:13:17,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 202 states have (on average 1.9207920792079207) internal successors, (388), 264 states have internal predecessors, (388), 0 states have call successors, (0), 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 14:13:17,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 388 transitions. [2022-12-14 14:13:17,569 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 388 transitions. Word has length 14 [2022-12-14 14:13:17,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:17,569 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 388 transitions. [2022-12-14 14:13:17,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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 14:13:17,569 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 388 transitions. [2022-12-14 14:13:17,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 14:13:17,570 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:17,570 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:13:17,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 14:13:17,570 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:13:17,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:17,570 INFO L85 PathProgramCache]: Analyzing trace with hash -2143096938, now seen corresponding path program 1 times [2022-12-14 14:13:17,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:17,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086168521] [2022-12-14 14:13:17,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:17,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:17,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:13:17,700 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:17,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086168521] [2022-12-14 14:13:17,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086168521] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:13:17,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:13:17,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 14:13:17,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063323960] [2022-12-14 14:13:17,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:13:17,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 14:13:17,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:17,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 14:13:17,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-14 14:13:17,702 INFO L87 Difference]: Start difference. First operand 265 states and 388 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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 14:13:18,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:18,300 INFO L93 Difference]: Finished difference Result 661 states and 991 transitions. [2022-12-14 14:13:18,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 14:13:18,300 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-12-14 14:13:18,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:18,304 INFO L225 Difference]: With dead ends: 661 [2022-12-14 14:13:18,304 INFO L226 Difference]: Without dead ends: 661 [2022-12-14 14:13:18,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-12-14 14:13:18,305 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 314 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:18,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 734 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 14:13:18,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2022-12-14 14:13:18,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 264. [2022-12-14 14:13:18,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 202 states have (on average 1.9158415841584158) internal successors, (387), 263 states have internal predecessors, (387), 0 states have call successors, (0), 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 14:13:18,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 387 transitions. [2022-12-14 14:13:18,310 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 387 transitions. Word has length 14 [2022-12-14 14:13:18,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:18,310 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 387 transitions. [2022-12-14 14:13:18,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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 14:13:18,310 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 387 transitions. [2022-12-14 14:13:18,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 14:13:18,311 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:18,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:13:18,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 14:13:18,311 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:13:18,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:18,311 INFO L85 PathProgramCache]: Analyzing trace with hash 2115262429, now seen corresponding path program 1 times [2022-12-14 14:13:18,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:18,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743885286] [2022-12-14 14:13:18,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:18,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:18,335 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 14:13:18,335 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:18,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743885286] [2022-12-14 14:13:18,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743885286] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:13:18,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:13:18,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:13:18,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547612865] [2022-12-14 14:13:18,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:13:18,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:13:18,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:18,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:13:18,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:13:18,337 INFO L87 Difference]: Start difference. First operand 264 states and 387 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 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 14:13:18,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:18,386 INFO L93 Difference]: Finished difference Result 332 states and 459 transitions. [2022-12-14 14:13:18,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:13:18,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-12-14 14:13:18,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:18,389 INFO L225 Difference]: With dead ends: 332 [2022-12-14 14:13:18,389 INFO L226 Difference]: Without dead ends: 332 [2022-12-14 14:13:18,389 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 14:13:18,390 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 139 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:18,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 227 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:13:18,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-12-14 14:13:18,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 298. [2022-12-14 14:13:18,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 236 states have (on average 1.944915254237288) internal successors, (459), 297 states have internal predecessors, (459), 0 states have call successors, (0), 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 14:13:18,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 459 transitions. [2022-12-14 14:13:18,395 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 459 transitions. Word has length 14 [2022-12-14 14:13:18,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:18,395 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 459 transitions. [2022-12-14 14:13:18,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 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 14:13:18,396 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 459 transitions. [2022-12-14 14:13:18,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 14:13:18,396 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:18,396 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:13:18,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 14:13:18,396 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:13:18,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:18,397 INFO L85 PathProgramCache]: Analyzing trace with hash -819690949, now seen corresponding path program 1 times [2022-12-14 14:13:18,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:18,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513206604] [2022-12-14 14:13:18,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:18,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:18,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:13:18,783 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:18,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513206604] [2022-12-14 14:13:18,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513206604] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:13:18,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574189636] [2022-12-14 14:13:18,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:18,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:13:18,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a13c396f-9da5-40a6-bed3-69934c130c27/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:13:18,785 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a13c396f-9da5-40a6-bed3-69934c130c27/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:13:18,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a13c396f-9da5-40a6-bed3-69934c130c27/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 14:13:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:18,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-14 14:13:18,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:13:18,917 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 14:13:18,940 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:13:18,941 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 14:13:18,968 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 14:13:19,033 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:13:19,034 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-12-14 14:13:19,051 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:13:19,052 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 14:13:19,090 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 17 treesize of output 19 [2022-12-14 14:13:19,133 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:13:19,134 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-12-14 14:13:19,179 INFO L321 Elim1Store]: treesize reduction 36, result has 37.9 percent of original size [2022-12-14 14:13:19,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 33 [2022-12-14 14:13:19,191 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 31 treesize of output 13 [2022-12-14 14:13:19,194 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:13:19,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:13:19,275 INFO L321 Elim1Store]: treesize reduction 10, result has 76.7 percent of original size [2022-12-14 14:13:19,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 74 [2022-12-14 14:13:19,291 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_448 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem11#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_448) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)))) is different from false [2022-12-14 14:13:19,504 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:13:19,505 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-12-14 14:13:19,507 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:13:19,509 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 39 treesize of output 27 [2022-12-14 14:13:19,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 4 [2022-12-14 14:13:19,519 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-14 14:13:19,519 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 13 treesize of output 12 [2022-12-14 14:13:19,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:13:19,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574189636] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:13:19,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [629007734] [2022-12-14 14:13:19,553 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-12-14 14:13:19,553 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:13:19,556 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:13:19,561 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:13:19,561 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:13:19,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,593 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 14:13:19,607 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 14:13:19,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,615 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 14:13:19,622 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 14:13:19,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 14:13:19,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,650 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 29 treesize of output 35 [2022-12-14 14:13:19,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,662 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 34 treesize of output 21 [2022-12-14 14:13:19,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,672 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 14:13:19,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 32 [2022-12-14 14:13:19,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,700 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 34 treesize of output 21 [2022-12-14 14:13:19,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-12-14 14:13:19,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,758 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 14:13:19,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 221 treesize of output 145 [2022-12-14 14:13:19,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 116 [2022-12-14 14:13:19,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,792 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 60 treesize of output 21 [2022-12-14 14:13:19,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,838 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 59 treesize of output 60 [2022-12-14 14:13:19,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,902 INFO L321 Elim1Store]: treesize reduction 31, result has 29.5 percent of original size [2022-12-14 14:13:19,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 247 treesize of output 170 [2022-12-14 14:13:19,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 85 [2022-12-14 14:13:19,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,938 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 14:13:19,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:19,995 INFO L321 Elim1Store]: treesize reduction 83, result has 15.3 percent of original size [2022-12-14 14:13:19,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 313 treesize of output 215 [2022-12-14 14:13:20,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:20,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:20,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:20,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:20,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:20,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 123 [2022-12-14 14:13:20,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:20,027 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 48 treesize of output 21 [2022-12-14 14:13:20,211 INFO L321 Elim1Store]: treesize reduction 180, result has 16.7 percent of original size [2022-12-14 14:13:20,211 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 571 treesize of output 561 [2022-12-14 14:13:20,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:20,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:20,402 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:13:20,453 INFO L321 Elim1Store]: treesize reduction 232, result has 10.8 percent of original size [2022-12-14 14:13:20,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 796 treesize of output 525 [2022-12-14 14:13:20,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:20,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:20,476 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:13:20,552 INFO L321 Elim1Store]: treesize reduction 336, result has 11.6 percent of original size [2022-12-14 14:13:20,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 778 treesize of output 716 [2022-12-14 14:13:20,593 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-12-14 14:13:20,594 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 715 treesize of output 698 [2022-12-14 14:13:20,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:20,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:20,694 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:13:20,832 INFO L321 Elim1Store]: treesize reduction 400, result has 12.1 percent of original size [2022-12-14 14:13:20,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 879 treesize of output 576 [2022-12-14 14:13:20,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:20,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:20,863 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:13:20,982 INFO L321 Elim1Store]: treesize reduction 460, result has 9.3 percent of original size [2022-12-14 14:13:20,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 795 treesize of output 689 [2022-12-14 14:13:21,034 INFO L321 Elim1Store]: treesize reduction 128, result has 10.5 percent of original size [2022-12-14 14:13:21,035 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 637 treesize of output 590 [2022-12-14 14:13:21,157 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 14:13:21,161 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 14:13:21,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:21,192 INFO L321 Elim1Store]: treesize reduction 63, result has 17.1 percent of original size [2022-12-14 14:13:21,192 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 72 [2022-12-14 14:13:21,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:21,211 INFO L321 Elim1Store]: treesize reduction 63, result has 17.1 percent of original size [2022-12-14 14:13:21,211 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 66 [2022-12-14 14:13:21,219 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 14:13:21,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:21,287 INFO L321 Elim1Store]: treesize reduction 76, result has 42.9 percent of original size [2022-12-14 14:13:21,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 180 treesize of output 155 [2022-12-14 14:13:21,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:21,325 INFO L321 Elim1Store]: treesize reduction 52, result has 46.4 percent of original size [2022-12-14 14:13:21,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 142 treesize of output 123 [2022-12-14 14:13:21,335 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 14:13:21,413 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 14:13:21,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 14:13:21,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:21,447 INFO L321 Elim1Store]: treesize reduction 63, result has 17.1 percent of original size [2022-12-14 14:13:21,447 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 72 [2022-12-14 14:13:21,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:21,465 INFO L321 Elim1Store]: treesize reduction 63, result has 17.1 percent of original size [2022-12-14 14:13:21,465 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 66 [2022-12-14 14:13:21,471 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 14:13:21,476 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:13:22,585 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7745#(and (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) (= |ULTIMATE.start_main_~tree~0#1.offset| 0) (= 1 (select |#valid| |ULTIMATE.start_main_~tmpList~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select |#length| |ULTIMATE.start_main_~tmpList~0#1.base|) 4) (<= (+ 12 |ULTIMATE.start_main_~tree~0#1.offset|) (select |#length| |ULTIMATE.start_main_~tree~0#1.base|)) (= |ULTIMATE.start_main_#t~mem9#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) (not (= 0 |ULTIMATE.start_main_~tmpList~0#1.base|)) (= |#NULL.offset| 0) (< |ULTIMATE.start_main_~tmpList~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~tmpList~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (not (= (select |#valid| |ULTIMATE.start_main_#t~mem9#1.base|) 1)) (= |#NULL.base| 0))' at error location [2022-12-14 14:13:22,585 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:13:22,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:13:22,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 11] total 26 [2022-12-14 14:13:22,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025713255] [2022-12-14 14:13:22,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:13:22,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-14 14:13:22,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:13:22,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-14 14:13:22,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1392, Unknown=5, NotChecked=78, Total=1722 [2022-12-14 14:13:22,587 INFO L87 Difference]: Start difference. First operand 298 states and 459 transitions. Second operand has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 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 14:13:23,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:13:23,714 INFO L93 Difference]: Finished difference Result 571 states and 853 transitions. [2022-12-14 14:13:23,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 14:13:23,715 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 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 14:13:23,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:13:23,716 INFO L225 Difference]: With dead ends: 571 [2022-12-14 14:13:23,716 INFO L226 Difference]: Without dead ends: 571 [2022-12-14 14:13:23,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=415, Invalid=2034, Unknown=5, NotChecked=96, Total=2550 [2022-12-14 14:13:23,717 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 810 mSDsluCounter, 1581 mSDsCounter, 0 mSdLazyCounter, 2079 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 2471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 348 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 14:13:23,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 1715 Invalid, 2471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2079 Invalid, 0 Unknown, 348 Unchecked, 0.9s Time] [2022-12-14 14:13:23,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-12-14 14:13:23,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 297. [2022-12-14 14:13:23,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 236 states have (on average 1.9406779661016949) internal successors, (458), 296 states have internal predecessors, (458), 0 states have call successors, (0), 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 14:13:23,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 458 transitions. [2022-12-14 14:13:23,722 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 458 transitions. Word has length 18 [2022-12-14 14:13:23,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:13:23,722 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 458 transitions. [2022-12-14 14:13:23,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 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 14:13:23,722 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 458 transitions. [2022-12-14 14:13:23,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 14:13:23,723 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:13:23,723 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:13:23,729 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a13c396f-9da5-40a6-bed3-69934c130c27/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 14:13:23,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a13c396f-9da5-40a6-bed3-69934c130c27/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:13:23,924 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:13:23,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:13:23,924 INFO L85 PathProgramCache]: Analyzing trace with hash -819690948, now seen corresponding path program 1 times [2022-12-14 14:13:23,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:13:23,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525750676] [2022-12-14 14:13:23,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:23,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:13:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:24,486 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:13:24,487 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:13:24,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525750676] [2022-12-14 14:13:24,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525750676] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:13:24,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526987766] [2022-12-14 14:13:24,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:13:24,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:13:24,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a13c396f-9da5-40a6-bed3-69934c130c27/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:13:24,488 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a13c396f-9da5-40a6-bed3-69934c130c27/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:13:24,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a13c396f-9da5-40a6-bed3-69934c130c27/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 14:13:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:13:24,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-14 14:13:24,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:13:24,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 14:13:24,593 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:13:24,594 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 14:13:24,613 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 14:13:24,619 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 14:13:24,675 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:13:24,675 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-12-14 14:13:24,678 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 22 treesize of output 24 [2022-12-14 14:13:24,691 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:13:24,691 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 14:13:24,728 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 16 treesize of output 18 [2022-12-14 14:13:24,731 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 17 treesize of output 19 [2022-12-14 14:13:24,790 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:13:24,791 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 62 [2022-12-14 14:13:24,796 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 41 treesize of output 41 [2022-12-14 14:13:24,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:24,838 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 26 treesize of output 28 [2022-12-14 14:13:24,843 INFO L321 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-12-14 14:13:24,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 17 treesize of output 17 [2022-12-14 14:13:24,866 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 39 treesize of output 21 [2022-12-14 14:13:24,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 32 treesize of output 14 [2022-12-14 14:13:24,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:13:24,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:13:25,028 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:13:25,028 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 102 treesize of output 106 [2022-12-14 14:13:25,045 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:13:25,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 107 [2022-12-14 14:13:25,254 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (and (forall ((v_prenex_1 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_1) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) 1))) (forall ((v_ArrVal_548 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_548) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (forall ((v_ArrVal_547 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_547) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))))) is different from false [2022-12-14 14:13:25,270 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (and (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_547 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_545))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_547) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) .cse1)))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_prenex_1 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_546))) (< (select (select (store .cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_545) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_prenex_1) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) (+ (select (select .cse3 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) 1)))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_546) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_545) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_ArrVal_548) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))))) is different from false [2022-12-14 14:13:25,877 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:13:25,877 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 138 [2022-12-14 14:13:25,886 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:13:25,887 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 98 [2022-12-14 14:13:25,894 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 1348 treesize of output 1222 [2022-12-14 14:13:25,943 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 3140 treesize of output 3050 [2022-12-14 14:13:25,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3045 treesize of output 2981 [2022-12-14 14:13:25,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2981 treesize of output 2869 [2022-12-14 14:13:25,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2869 treesize of output 2645 [2022-12-14 14:13:26,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2645 treesize of output 2589 [2022-12-14 14:13:26,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2589 treesize of output 2397 [2022-12-14 14:13:26,069 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:13:26,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2404 treesize of output 2422 [2022-12-14 14:13:26,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2393 treesize of output 2321 [2022-12-14 14:13:26,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2321 treesize of output 2257 [2022-12-14 14:13:26,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2257 treesize of output 2129 [2022-12-14 14:13:27,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 14:13:27,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526987766] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:13:27,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1135041190] [2022-12-14 14:13:27,716 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-12-14 14:13:27,716 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:13:27,716 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:13:27,716 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:13:27,716 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:13:27,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,727 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 14:13:27,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:13:27,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,743 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 14:13:27,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:13:27,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,761 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 14:13:27,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,767 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 14:13:27,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,775 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 34 treesize of output 21 [2022-12-14 14:13:27,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,787 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 29 treesize of output 35 [2022-12-14 14:13:27,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 32 [2022-12-14 14:13:27,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,807 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 34 treesize of output 21 [2022-12-14 14:13:27,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-12-14 14:13:27,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,860 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 14:13:27,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 221 treesize of output 145 [2022-12-14 14:13:27,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 116 [2022-12-14 14:13:27,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,881 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 60 treesize of output 21 [2022-12-14 14:13:27,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,917 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 59 treesize of output 60 [2022-12-14 14:13:27,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,944 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 14:13:27,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,965 INFO L321 Elim1Store]: treesize reduction 31, result has 29.5 percent of original size [2022-12-14 14:13:27,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 247 treesize of output 170 [2022-12-14 14:13:27,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:27,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 93 [2022-12-14 14:13:28,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:28,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:28,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:28,039 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-12-14 14:13:28,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 332 treesize of output 213 [2022-12-14 14:13:28,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:28,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:28,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:28,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:28,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:28,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 111 [2022-12-14 14:13:28,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:28,068 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 42 treesize of output 21 [2022-12-14 14:13:28,260 INFO L321 Elim1Store]: treesize reduction 252, result has 20.5 percent of original size [2022-12-14 14:13:28,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 551 treesize of output 572 [2022-12-14 14:13:28,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:28,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:28,551 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:13:28,799 INFO L321 Elim1Store]: treesize reduction 252, result has 29.6 percent of original size [2022-12-14 14:13:28,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 5 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 30 case distinctions, treesize of input 847 treesize of output 726 [2022-12-14 14:13:28,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:28,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:13:28,835 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:13:29,101 INFO L321 Elim1Store]: treesize reduction 252, result has 29.6 percent of original size [2022-12-14 14:13:29,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 5 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 30 case distinctions, treesize of input 721 treesize of output 740 [2022-12-14 14:13:29,149 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-12-14 14:13:29,149 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 642 treesize of output 625 [2022-12-14 14:20:18,981 WARN L233 SmtUtils]: Spent 7.87s on a formula simplification. DAG size of input: 3938 DAG size of output: 3937 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-14 14:23:41,979 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-12-14 14:23:41,979 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 104 [2022-12-14 14:23:41,998 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-12-14 14:23:41,998 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 81 [2022-12-14 14:23:42,003 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 14:23:42,029 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 14:23:42,033 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 14:23:42,048 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 14:23:42,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:42,069 INFO L321 Elim1Store]: treesize reduction 63, result has 17.1 percent of original size [2022-12-14 14:23:42,070 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 72 [2022-12-14 14:23:42,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:42,090 INFO L321 Elim1Store]: treesize reduction 63, result has 17.1 percent of original size [2022-12-14 14:23:42,090 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 66 [2022-12-14 14:23:42,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:42,158 INFO L321 Elim1Store]: treesize reduction 76, result has 42.9 percent of original size [2022-12-14 14:23:42,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 180 treesize of output 155 [2022-12-14 14:23:42,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:42,210 INFO L321 Elim1Store]: treesize reduction 52, result has 46.4 percent of original size [2022-12-14 14:23:42,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 142 treesize of output 123 [2022-12-14 14:23:42,220 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 14:23:42,287 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 14:23:42,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 14:23:42,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:42,322 INFO L321 Elim1Store]: treesize reduction 63, result has 17.1 percent of original size [2022-12-14 14:23:42,322 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 72 [2022-12-14 14:23:42,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:42,344 INFO L321 Elim1Store]: treesize reduction 63, result has 17.1 percent of original size [2022-12-14 14:23:42,344 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 66 [2022-12-14 14:23:42,351 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 14:23:42,356 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:23:43,766 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8778#(and (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) (<= 0 |#NULL.base|) (= 1 (select |#valid| |ULTIMATE.start_main_~tmpList~0#1.base|)) (<= 0 |ULTIMATE.start_main_~tree~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select |#length| |ULTIMATE.start_main_~tmpList~0#1.base|) 4) (<= (+ 12 |ULTIMATE.start_main_~tree~0#1.offset|) (select |#length| |ULTIMATE.start_main_~tree~0#1.base|)) (<= |#NULL.offset| 0) (= |ULTIMATE.start_main_#t~mem9#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |ULTIMATE.start_main_~tree~0#1.offset|))) (not (= 0 |ULTIMATE.start_main_~tmpList~0#1.base|)) (<= |#NULL.base| 0) (< |ULTIMATE.start_main_~tmpList~0#1.base| |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~tree~0#1.offset| 0) (or (not (<= 0 |ULTIMATE.start_main_#t~mem9#1.offset|)) (not (<= (+ |ULTIMATE.start_main_#t~mem9#1.offset| 4) (select |#length| |ULTIMATE.start_main_#t~mem9#1.base|)))) (<= 0 |#NULL.offset|) (= |ULTIMATE.start_main_~tmpList~0#1.offset| 0) (<= 0 |#StackHeapBarrier|))' at error location [2022-12-14 14:23:43,767 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:23:43,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:23:43,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 29 [2022-12-14 14:23:43,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581682787] [2022-12-14 14:23:43,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:23:43,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-14 14:23:43,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:23:43,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-14 14:23:43,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1557, Unknown=20, NotChecked=166, Total=1980 [2022-12-14 14:23:43,768 INFO L87 Difference]: Start difference. First operand 297 states and 458 transitions. Second operand has 31 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 30 states have internal predecessors, (53), 0 states have call successors, (0), 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 14:23:46,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:23:46,096 INFO L93 Difference]: Finished difference Result 570 states and 852 transitions. [2022-12-14 14:23:46,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 14:23:46,097 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 30 states have internal predecessors, (53), 0 states have call successors, (0), 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 14:23:46,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:23:46,100 INFO L225 Difference]: With dead ends: 570 [2022-12-14 14:23:46,100 INFO L226 Difference]: Without dead ends: 570 [2022-12-14 14:23:46,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=430, Invalid=2312, Unknown=22, NotChecked=206, Total=2970 [2022-12-14 14:23:46,102 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 881 mSDsluCounter, 1585 mSDsCounter, 0 mSdLazyCounter, 2625 mSolverCounterSat, 40 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 3048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2625 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 370 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-14 14:23:46,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 1703 Invalid, 3048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2625 Invalid, 13 Unknown, 370 Unchecked, 1.7s Time] [2022-12-14 14:23:46,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2022-12-14 14:23:46,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 292. [2022-12-14 14:23:46,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 232 states have (on average 1.9482758620689655) internal successors, (452), 291 states have internal predecessors, (452), 0 states have call successors, (0), 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 14:23:46,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 452 transitions. [2022-12-14 14:23:46,111 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 452 transitions. Word has length 18 [2022-12-14 14:23:46,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:23:46,111 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 452 transitions. [2022-12-14 14:23:46,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 30 states have internal predecessors, (53), 0 states have call successors, (0), 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 14:23:46,111 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 452 transitions. [2022-12-14 14:23:46,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 14:23:46,112 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:23:46,112 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:23:46,116 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a13c396f-9da5-40a6-bed3-69934c130c27/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 14:23:46,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a13c396f-9da5-40a6-bed3-69934c130c27/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 14:23:46,313 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:23:46,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:23:46,313 INFO L85 PathProgramCache]: Analyzing trace with hash 553140911, now seen corresponding path program 1 times [2022-12-14 14:23:46,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:23:46,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057643562] [2022-12-14 14:23:46,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:23:46,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:23:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:23:46,333 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 14:23:46,333 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:23:46,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057643562] [2022-12-14 14:23:46,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057643562] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:23:46,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:23:46,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:23:46,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454737820] [2022-12-14 14:23:46,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:23:46,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:23:46,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:23:46,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:23:46,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:23:46,335 INFO L87 Difference]: Start difference. First operand 292 states and 452 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 14:23:46,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:23:46,377 INFO L93 Difference]: Finished difference Result 296 states and 456 transitions. [2022-12-14 14:23:46,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:23:46,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 14:23:46,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:23:46,379 INFO L225 Difference]: With dead ends: 296 [2022-12-14 14:23:46,379 INFO L226 Difference]: Without dead ends: 296 [2022-12-14 14:23:46,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:23:46,380 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:23:46,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 251 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:23:46,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-12-14 14:23:46,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-12-14 14:23:46,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 236 states have (on average 1.9322033898305084) internal successors, (456), 295 states have internal predecessors, (456), 0 states have call successors, (0), 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 14:23:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 456 transitions. [2022-12-14 14:23:46,384 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 456 transitions. Word has length 18 [2022-12-14 14:23:46,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:23:46,384 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 456 transitions. [2022-12-14 14:23:46,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 14:23:46,385 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 456 transitions. [2022-12-14 14:23:46,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 14:23:46,385 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:23:46,385 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:23:46,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 14:23:46,385 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:23:46,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:23:46,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1939428640, now seen corresponding path program 1 times [2022-12-14 14:23:46,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:23:46,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656396043] [2022-12-14 14:23:46,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:23:46,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:23:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:23:46,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:23:46,405 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:23:46,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656396043] [2022-12-14 14:23:46,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656396043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:23:46,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:23:46,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:23:46,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405466974] [2022-12-14 14:23:46,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:23:46,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:23:46,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:23:46,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:23:46,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:23:46,407 INFO L87 Difference]: Start difference. First operand 296 states and 456 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 14:23:46,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:23:46,450 INFO L93 Difference]: Finished difference Result 299 states and 459 transitions. [2022-12-14 14:23:46,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:23:46,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 14:23:46,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:23:46,453 INFO L225 Difference]: With dead ends: 299 [2022-12-14 14:23:46,453 INFO L226 Difference]: Without dead ends: 299 [2022-12-14 14:23:46,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:23:46,454 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:23:46,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 251 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:23:46,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-12-14 14:23:46,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2022-12-14 14:23:46,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 239 states have (on average 1.9205020920502092) internal successors, (459), 298 states have internal predecessors, (459), 0 states have call successors, (0), 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 14:23:46,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 459 transitions. [2022-12-14 14:23:46,459 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 459 transitions. Word has length 18 [2022-12-14 14:23:46,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:23:46,459 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 459 transitions. [2022-12-14 14:23:46,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 14:23:46,459 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 459 transitions. [2022-12-14 14:23:46,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 14:23:46,460 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:23:46,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:23:46,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 14:23:46,460 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:23:46,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:23:46,460 INFO L85 PathProgramCache]: Analyzing trace with hash -26953863, now seen corresponding path program 1 times [2022-12-14 14:23:46,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:23:46,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410900759] [2022-12-14 14:23:46,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:23:46,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:23:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:23:46,486 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 14:23:46,486 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:23:46,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410900759] [2022-12-14 14:23:46,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410900759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:23:46,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:23:46,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:23:46,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983080470] [2022-12-14 14:23:46,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:23:46,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:23:46,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:23:46,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:23:46,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:23:46,488 INFO L87 Difference]: Start difference. First operand 299 states and 459 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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 14:23:46,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:23:46,547 INFO L93 Difference]: Finished difference Result 337 states and 483 transitions. [2022-12-14 14:23:46,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:23:46,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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 19 [2022-12-14 14:23:46,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:23:46,549 INFO L225 Difference]: With dead ends: 337 [2022-12-14 14:23:46,549 INFO L226 Difference]: Without dead ends: 337 [2022-12-14 14:23:46,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:23:46,550 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 49 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:23:46,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 246 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:23:46,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-12-14 14:23:46,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 286. [2022-12-14 14:23:46,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 226 states have (on average 1.915929203539823) internal successors, (433), 285 states have internal predecessors, (433), 0 states have call successors, (0), 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 14:23:46,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 433 transitions. [2022-12-14 14:23:46,555 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 433 transitions. Word has length 19 [2022-12-14 14:23:46,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:23:46,555 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 433 transitions. [2022-12-14 14:23:46,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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 14:23:46,555 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 433 transitions. [2022-12-14 14:23:46,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 14:23:46,555 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:23:46,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:23:46,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-14 14:23:46,556 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:23:46,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:23:46,556 INFO L85 PathProgramCache]: Analyzing trace with hash 50602614, now seen corresponding path program 1 times [2022-12-14 14:23:46,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:23:46,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275689248] [2022-12-14 14:23:46,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:23:46,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:23:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:23:46,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:23:46,753 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:23:46,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275689248] [2022-12-14 14:23:46,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275689248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:23:46,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:23:46,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 14:23:46,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195316514] [2022-12-14 14:23:46,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:23:46,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 14:23:46,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:23:46,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 14:23:46,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-14 14:23:46,755 INFO L87 Difference]: Start difference. First operand 286 states and 433 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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 14:23:47,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:23:47,214 INFO L93 Difference]: Finished difference Result 487 states and 658 transitions. [2022-12-14 14:23:47,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 14:23:47,214 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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 19 [2022-12-14 14:23:47,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:23:47,215 INFO L225 Difference]: With dead ends: 487 [2022-12-14 14:23:47,215 INFO L226 Difference]: Without dead ends: 487 [2022-12-14 14:23:47,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-12-14 14:23:47,216 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 292 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:23:47,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 827 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 14:23:47,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2022-12-14 14:23:47,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 299. [2022-12-14 14:23:47,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 239 states have (on average 1.8828451882845187) internal successors, (450), 298 states have internal predecessors, (450), 0 states have call successors, (0), 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 14:23:47,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 450 transitions. [2022-12-14 14:23:47,221 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 450 transitions. Word has length 19 [2022-12-14 14:23:47,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:23:47,221 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 450 transitions. [2022-12-14 14:23:47,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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 14:23:47,221 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 450 transitions. [2022-12-14 14:23:47,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 14:23:47,222 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:23:47,222 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:23:47,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-14 14:23:47,222 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:23:47,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:23:47,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1006344639, now seen corresponding path program 1 times [2022-12-14 14:23:47,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:23:47,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464834810] [2022-12-14 14:23:47,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:23:47,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:23:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:23:47,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:23:47,416 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:23:47,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464834810] [2022-12-14 14:23:47,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464834810] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:23:47,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:23:47,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 14:23:47,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692220669] [2022-12-14 14:23:47,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:23:47,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 14:23:47,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:23:47,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 14:23:47,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-14 14:23:47,418 INFO L87 Difference]: Start difference. First operand 299 states and 450 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 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 14:23:47,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:23:47,872 INFO L93 Difference]: Finished difference Result 485 states and 654 transitions. [2022-12-14 14:23:47,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 14:23:47,873 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 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 14:23:47,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:23:47,874 INFO L225 Difference]: With dead ends: 485 [2022-12-14 14:23:47,874 INFO L226 Difference]: Without dead ends: 485 [2022-12-14 14:23:47,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-12-14 14:23:47,874 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 317 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:23:47,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 700 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 14:23:47,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-12-14 14:23:47,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 335. [2022-12-14 14:23:47,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 275 states have (on average 1.8836363636363636) internal successors, (518), 334 states have internal predecessors, (518), 0 states have call successors, (0), 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 14:23:47,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 518 transitions. [2022-12-14 14:23:47,879 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 518 transitions. Word has length 20 [2022-12-14 14:23:47,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:23:47,880 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 518 transitions. [2022-12-14 14:23:47,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 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 14:23:47,880 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 518 transitions. [2022-12-14 14:23:47,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 14:23:47,880 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:23:47,880 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:23:47,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-14 14:23:47,880 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:23:47,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:23:47,881 INFO L85 PathProgramCache]: Analyzing trace with hash -267643194, now seen corresponding path program 1 times [2022-12-14 14:23:47,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:23:47,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769921207] [2022-12-14 14:23:47,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:23:47,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:23:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:23:47,910 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 14:23:47,910 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:23:47,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769921207] [2022-12-14 14:23:47,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769921207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:23:47,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:23:47,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:23:47,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476014254] [2022-12-14 14:23:47,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:23:47,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:23:47,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:23:47,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:23:47,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:23:47,912 INFO L87 Difference]: Start difference. First operand 335 states and 518 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 14:23:48,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:23:48,031 INFO L93 Difference]: Finished difference Result 507 states and 789 transitions. [2022-12-14 14:23:48,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:23:48,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 14:23:48,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:23:48,034 INFO L225 Difference]: With dead ends: 507 [2022-12-14 14:23:48,034 INFO L226 Difference]: Without dead ends: 507 [2022-12-14 14:23:48,034 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 14:23:48,035 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 109 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:23:48,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 221 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:23:48,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-12-14 14:23:48,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 330. [2022-12-14 14:23:48,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 275 states have (on average 1.8654545454545455) internal successors, (513), 329 states have internal predecessors, (513), 0 states have call successors, (0), 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 14:23:48,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 513 transitions. [2022-12-14 14:23:48,042 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 513 transitions. Word has length 20 [2022-12-14 14:23:48,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:23:48,042 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 513 transitions. [2022-12-14 14:23:48,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 14:23:48,042 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 513 transitions. [2022-12-14 14:23:48,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 14:23:48,043 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:23:48,043 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:23:48,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-14 14:23:48,043 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:23:48,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:23:48,044 INFO L85 PathProgramCache]: Analyzing trace with hash -267643193, now seen corresponding path program 1 times [2022-12-14 14:23:48,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:23:48,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471395983] [2022-12-14 14:23:48,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:23:48,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:23:48,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:23:48,097 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 14:23:48,097 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:23:48,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471395983] [2022-12-14 14:23:48,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471395983] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:23:48,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:23:48,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:23:48,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529453825] [2022-12-14 14:23:48,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:23:48,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:23:48,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:23:48,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:23:48,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:23:48,098 INFO L87 Difference]: Start difference. First operand 330 states and 513 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 14:23:48,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:23:48,226 INFO L93 Difference]: Finished difference Result 459 states and 706 transitions. [2022-12-14 14:23:48,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:23:48,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 14:23:48,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:23:48,228 INFO L225 Difference]: With dead ends: 459 [2022-12-14 14:23:48,228 INFO L226 Difference]: Without dead ends: 459 [2022-12-14 14:23:48,228 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 14:23:48,229 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 106 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:23:48,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 220 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:23:48,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-12-14 14:23:48,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 325. [2022-12-14 14:23:48,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 275 states have (on average 1.8472727272727272) internal successors, (508), 324 states have internal predecessors, (508), 0 states have call successors, (0), 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 14:23:48,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 508 transitions. [2022-12-14 14:23:48,236 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 508 transitions. Word has length 20 [2022-12-14 14:23:48,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:23:48,237 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 508 transitions. [2022-12-14 14:23:48,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 14:23:48,237 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 508 transitions. [2022-12-14 14:23:48,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:23:48,237 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:23:48,237 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:23:48,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-14 14:23:48,238 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:23:48,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:23:48,238 INFO L85 PathProgramCache]: Analyzing trace with hash -131673973, now seen corresponding path program 1 times [2022-12-14 14:23:48,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:23:48,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694641334] [2022-12-14 14:23:48,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:23:48,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:23:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:23:48,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:23:48,311 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:23:48,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694641334] [2022-12-14 14:23:48,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694641334] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:23:48,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:23:48,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 14:23:48,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531003702] [2022-12-14 14:23:48,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:23:48,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:23:48,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:23:48,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:23:48,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:23:48,313 INFO L87 Difference]: Start difference. First operand 325 states and 508 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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 14:23:48,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:23:48,482 INFO L93 Difference]: Finished difference Result 423 states and 661 transitions. [2022-12-14 14:23:48,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:23:48,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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 21 [2022-12-14 14:23:48,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:23:48,484 INFO L225 Difference]: With dead ends: 423 [2022-12-14 14:23:48,484 INFO L226 Difference]: Without dead ends: 423 [2022-12-14 14:23:48,485 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 14:23:48,485 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 55 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:23:48,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 279 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:23:48,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-12-14 14:23:48,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 334. [2022-12-14 14:23:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 284 states have (on average 1.8309859154929577) internal successors, (520), 333 states have internal predecessors, (520), 0 states have call successors, (0), 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 14:23:48,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 520 transitions. [2022-12-14 14:23:48,489 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 520 transitions. Word has length 21 [2022-12-14 14:23:48,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:23:48,490 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 520 transitions. [2022-12-14 14:23:48,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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 14:23:48,490 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 520 transitions. [2022-12-14 14:23:48,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:23:48,490 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:23:48,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:23:48,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-14 14:23:48,490 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:23:48,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:23:48,491 INFO L85 PathProgramCache]: Analyzing trace with hash -131668641, now seen corresponding path program 1 times [2022-12-14 14:23:48,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:23:48,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051561872] [2022-12-14 14:23:48,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:23:48,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:23:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:23:48,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:23:48,708 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:23:48,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051561872] [2022-12-14 14:23:48,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051561872] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:23:48,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:23:48,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 14:23:48,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849060059] [2022-12-14 14:23:48,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:23:48,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 14:23:48,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:23:48,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 14:23:48,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-14 14:23:48,710 INFO L87 Difference]: Start difference. First operand 334 states and 520 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 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 14:23:49,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:23:49,197 INFO L93 Difference]: Finished difference Result 455 states and 661 transitions. [2022-12-14 14:23:49,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 14:23:49,197 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 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 21 [2022-12-14 14:23:49,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:23:49,198 INFO L225 Difference]: With dead ends: 455 [2022-12-14 14:23:49,198 INFO L226 Difference]: Without dead ends: 455 [2022-12-14 14:23:49,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2022-12-14 14:23:49,198 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 327 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:23:49,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 551 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 14:23:49,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-12-14 14:23:49,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 302. [2022-12-14 14:23:49,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 252 states have (on average 1.8095238095238095) internal successors, (456), 301 states have internal predecessors, (456), 0 states have call successors, (0), 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 14:23:49,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 456 transitions. [2022-12-14 14:23:49,203 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 456 transitions. Word has length 21 [2022-12-14 14:23:49,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:23:49,203 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 456 transitions. [2022-12-14 14:23:49,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 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 14:23:49,203 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 456 transitions. [2022-12-14 14:23:49,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:23:49,203 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:23:49,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:23:49,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-14 14:23:49,204 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:23:49,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:23:49,204 INFO L85 PathProgramCache]: Analyzing trace with hash -132324160, now seen corresponding path program 1 times [2022-12-14 14:23:49,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:23:49,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676639699] [2022-12-14 14:23:49,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:23:49,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:23:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:23:49,341 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 14:23:49,341 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:23:49,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676639699] [2022-12-14 14:23:49,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676639699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:23:49,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:23:49,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 14:23:49,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652878808] [2022-12-14 14:23:49,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:23:49,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 14:23:49,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:23:49,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 14:23:49,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-14 14:23:49,343 INFO L87 Difference]: Start difference. First operand 302 states and 456 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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 14:23:49,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:23:49,710 INFO L93 Difference]: Finished difference Result 444 states and 650 transitions. [2022-12-14 14:23:49,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 14:23:49,710 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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 21 [2022-12-14 14:23:49,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:23:49,712 INFO L225 Difference]: With dead ends: 444 [2022-12-14 14:23:49,712 INFO L226 Difference]: Without dead ends: 444 [2022-12-14 14:23:49,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-12-14 14:23:49,713 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 410 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:23:49,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 556 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 14:23:49,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-12-14 14:23:49,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 306. [2022-12-14 14:23:49,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 256 states have (on average 1.80078125) internal successors, (461), 305 states have internal predecessors, (461), 0 states have call successors, (0), 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 14:23:49,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 461 transitions. [2022-12-14 14:23:49,719 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 461 transitions. Word has length 21 [2022-12-14 14:23:49,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:23:49,720 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 461 transitions. [2022-12-14 14:23:49,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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 14:23:49,720 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 461 transitions. [2022-12-14 14:23:49,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 14:23:49,720 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:23:49,720 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:23:49,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-14 14:23:49,721 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:23:49,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:23:49,721 INFO L85 PathProgramCache]: Analyzing trace with hash -132324159, now seen corresponding path program 1 times [2022-12-14 14:23:49,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:23:49,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031372145] [2022-12-14 14:23:49,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:23:49,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:23:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:23:49,973 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 14:23:49,973 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:23:49,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031372145] [2022-12-14 14:23:49,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031372145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:23:49,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:23:49,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 14:23:49,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584345315] [2022-12-14 14:23:49,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:23:49,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 14:23:49,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:23:49,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 14:23:49,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-14 14:23:49,976 INFO L87 Difference]: Start difference. First operand 306 states and 461 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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 14:23:50,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:23:50,436 INFO L93 Difference]: Finished difference Result 448 states and 654 transitions. [2022-12-14 14:23:50,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 14:23:50,436 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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 21 [2022-12-14 14:23:50,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:23:50,437 INFO L225 Difference]: With dead ends: 448 [2022-12-14 14:23:50,437 INFO L226 Difference]: Without dead ends: 448 [2022-12-14 14:23:50,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-12-14 14:23:50,438 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 311 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:23:50,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 454 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 14:23:50,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2022-12-14 14:23:50,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 306. [2022-12-14 14:23:50,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 256 states have (on average 1.796875) internal successors, (460), 305 states have internal predecessors, (460), 0 states have call successors, (0), 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 14:23:50,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 460 transitions. [2022-12-14 14:23:50,441 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 460 transitions. Word has length 21 [2022-12-14 14:23:50,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:23:50,441 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 460 transitions. [2022-12-14 14:23:50,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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 14:23:50,442 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 460 transitions. [2022-12-14 14:23:50,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:23:50,442 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:23:50,442 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:23:50,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-14 14:23:50,442 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:23:50,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:23:50,442 INFO L85 PathProgramCache]: Analyzing trace with hash 711177341, now seen corresponding path program 1 times [2022-12-14 14:23:50,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:23:50,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435603498] [2022-12-14 14:23:50,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:23:50,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:23:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:23:50,578 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 14:23:50,578 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:23:50,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435603498] [2022-12-14 14:23:50,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435603498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:23:50,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:23:50,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 14:23:50,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969560107] [2022-12-14 14:23:50,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:23:50,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 14:23:50,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:23:50,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 14:23:50,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-14 14:23:50,579 INFO L87 Difference]: Start difference. First operand 306 states and 460 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 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 14:23:50,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:23:50,934 INFO L93 Difference]: Finished difference Result 452 states and 658 transitions. [2022-12-14 14:23:50,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 14:23:50,934 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 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 24 [2022-12-14 14:23:50,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:23:50,935 INFO L225 Difference]: With dead ends: 452 [2022-12-14 14:23:50,935 INFO L226 Difference]: Without dead ends: 452 [2022-12-14 14:23:50,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2022-12-14 14:23:50,936 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 321 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:23:50,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 648 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 14:23:50,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2022-12-14 14:23:50,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 309. [2022-12-14 14:23:50,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 259 states have (on average 1.7915057915057915) internal successors, (464), 308 states have internal predecessors, (464), 0 states have call successors, (0), 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 14:23:50,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 464 transitions. [2022-12-14 14:23:50,940 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 464 transitions. Word has length 24 [2022-12-14 14:23:50,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:23:50,940 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 464 transitions. [2022-12-14 14:23:50,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 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 14:23:50,940 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 464 transitions. [2022-12-14 14:23:50,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:23:50,941 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:23:50,941 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:23:50,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-14 14:23:50,941 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:23:50,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:23:50,942 INFO L85 PathProgramCache]: Analyzing trace with hash 711178432, now seen corresponding path program 1 times [2022-12-14 14:23:50,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:23:50,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103219432] [2022-12-14 14:23:50,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:23:50,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:23:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:23:50,980 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 14:23:50,980 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:23:50,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103219432] [2022-12-14 14:23:50,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103219432] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:23:50,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:23:50,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 14:23:50,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634621315] [2022-12-14 14:23:50,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:23:50,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:23:50,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:23:50,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:23:50,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:23:50,982 INFO L87 Difference]: Start difference. First operand 309 states and 464 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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 14:23:51,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:23:51,112 INFO L93 Difference]: Finished difference Result 308 states and 460 transitions. [2022-12-14 14:23:51,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 14:23:51,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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 24 [2022-12-14 14:23:51,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:23:51,113 INFO L225 Difference]: With dead ends: 308 [2022-12-14 14:23:51,113 INFO L226 Difference]: Without dead ends: 308 [2022-12-14 14:23:51,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 14:23:51,114 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 23 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:23:51,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 251 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:23:51,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-12-14 14:23:51,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2022-12-14 14:23:51,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 259 states have (on average 1.776061776061776) internal successors, (460), 307 states have internal predecessors, (460), 0 states have call successors, (0), 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 14:23:51,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 460 transitions. [2022-12-14 14:23:51,117 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 460 transitions. Word has length 24 [2022-12-14 14:23:51,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:23:51,117 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 460 transitions. [2022-12-14 14:23:51,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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 14:23:51,117 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 460 transitions. [2022-12-14 14:23:51,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:23:51,117 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:23:51,117 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:23:51,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-14 14:23:51,118 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:23:51,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:23:51,118 INFO L85 PathProgramCache]: Analyzing trace with hash 711178433, now seen corresponding path program 1 times [2022-12-14 14:23:51,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:23:51,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645647079] [2022-12-14 14:23:51,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:23:51,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:23:51,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:23:51,178 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 14:23:51,178 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:23:51,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645647079] [2022-12-14 14:23:51,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645647079] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:23:51,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:23:51,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 14:23:51,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413512046] [2022-12-14 14:23:51,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:23:51,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:23:51,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:23:51,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:23:51,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:23:51,179 INFO L87 Difference]: Start difference. First operand 308 states and 460 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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 14:23:51,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:23:51,386 INFO L93 Difference]: Finished difference Result 307 states and 456 transitions. [2022-12-14 14:23:51,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 14:23:51,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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 24 [2022-12-14 14:23:51,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:23:51,388 INFO L225 Difference]: With dead ends: 307 [2022-12-14 14:23:51,389 INFO L226 Difference]: Without dead ends: 307 [2022-12-14 14:23:51,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 14:23:51,390 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 30 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:23:51,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 240 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:23:51,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-12-14 14:23:51,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2022-12-14 14:23:51,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 259 states have (on average 1.7606177606177607) internal successors, (456), 306 states have internal predecessors, (456), 0 states have call successors, (0), 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 14:23:51,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 456 transitions. [2022-12-14 14:23:51,394 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 456 transitions. Word has length 24 [2022-12-14 14:23:51,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:23:51,394 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 456 transitions. [2022-12-14 14:23:51,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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 14:23:51,394 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 456 transitions. [2022-12-14 14:23:51,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 14:23:51,394 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:23:51,394 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:23:51,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-14 14:23:51,395 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr98ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:23:51,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:23:51,395 INFO L85 PathProgramCache]: Analyzing trace with hash 571661437, now seen corresponding path program 1 times [2022-12-14 14:23:51,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:23:51,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172489399] [2022-12-14 14:23:51,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:23:51,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:23:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:23:51,521 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 14:23:51,522 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:23:51,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172489399] [2022-12-14 14:23:51,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172489399] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:23:51,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:23:51,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 14:23:51,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719515630] [2022-12-14 14:23:51,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:23:51,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 14:23:51,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:23:51,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 14:23:51,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-14 14:23:51,523 INFO L87 Difference]: Start difference. First operand 307 states and 456 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 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 14:23:51,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:23:51,974 INFO L93 Difference]: Finished difference Result 443 states and 641 transitions. [2022-12-14 14:23:51,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 14:23:51,974 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 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 25 [2022-12-14 14:23:51,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:23:51,977 INFO L225 Difference]: With dead ends: 443 [2022-12-14 14:23:51,977 INFO L226 Difference]: Without dead ends: 443 [2022-12-14 14:23:51,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-12-14 14:23:51,977 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 207 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:23:51,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 578 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 14:23:51,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-12-14 14:23:51,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 308. [2022-12-14 14:23:51,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 260 states have (on average 1.7576923076923077) internal successors, (457), 307 states have internal predecessors, (457), 0 states have call successors, (0), 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 14:23:51,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 457 transitions. [2022-12-14 14:23:51,982 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 457 transitions. Word has length 25 [2022-12-14 14:23:51,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:23:51,982 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 457 transitions. [2022-12-14 14:23:51,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 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 14:23:51,982 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 457 transitions. [2022-12-14 14:23:51,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 14:23:51,983 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:23:51,983 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:23:51,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-14 14:23:51,983 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:23:51,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:23:51,983 INFO L85 PathProgramCache]: Analyzing trace with hash 640560285, now seen corresponding path program 1 times [2022-12-14 14:23:51,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:23:51,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223682603] [2022-12-14 14:23:51,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:23:51,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:23:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:23:52,095 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 14:23:52,096 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:23:52,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223682603] [2022-12-14 14:23:52,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223682603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:23:52,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:23:52,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 14:23:52,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179806829] [2022-12-14 14:23:52,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:23:52,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:23:52,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:23:52,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:23:52,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:23:52,097 INFO L87 Difference]: Start difference. First operand 308 states and 457 transitions. Second operand has 5 states, 4 states have (on average 6.25) 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 14:23:52,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:23:52,258 INFO L93 Difference]: Finished difference Result 307 states and 456 transitions. [2022-12-14 14:23:52,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:23:52,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) 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 25 [2022-12-14 14:23:52,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:23:52,260 INFO L225 Difference]: With dead ends: 307 [2022-12-14 14:23:52,260 INFO L226 Difference]: Without dead ends: 307 [2022-12-14 14:23:52,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 14:23:52,261 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 4 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:23:52,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 288 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:23:52,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-12-14 14:23:52,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2022-12-14 14:23:52,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 260 states have (on average 1.7538461538461538) internal successors, (456), 306 states have internal predecessors, (456), 0 states have call successors, (0), 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 14:23:52,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 456 transitions. [2022-12-14 14:23:52,264 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 456 transitions. Word has length 25 [2022-12-14 14:23:52,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:23:52,264 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 456 transitions. [2022-12-14 14:23:52,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) 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 14:23:52,264 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 456 transitions. [2022-12-14 14:23:52,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 14:23:52,264 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:23:52,264 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:23:52,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-14 14:23:52,265 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:23:52,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:23:52,265 INFO L85 PathProgramCache]: Analyzing trace with hash 640560284, now seen corresponding path program 1 times [2022-12-14 14:23:52,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:23:52,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542342367] [2022-12-14 14:23:52,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:23:52,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:23:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:23:52,331 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 14:23:52,332 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:23:52,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542342367] [2022-12-14 14:23:52,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542342367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:23:52,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:23:52,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 14:23:52,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237727058] [2022-12-14 14:23:52,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:23:52,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:23:52,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:23:52,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:23:52,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:23:52,333 INFO L87 Difference]: Start difference. First operand 307 states and 456 transitions. Second operand has 5 states, 4 states have (on average 6.25) 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 14:23:52,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:23:52,472 INFO L93 Difference]: Finished difference Result 306 states and 455 transitions. [2022-12-14 14:23:52,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:23:52,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) 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 25 [2022-12-14 14:23:52,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:23:52,473 INFO L225 Difference]: With dead ends: 306 [2022-12-14 14:23:52,474 INFO L226 Difference]: Without dead ends: 306 [2022-12-14 14:23:52,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 14:23:52,474 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 2 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:23:52,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 315 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:23:52,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-12-14 14:23:52,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2022-12-14 14:23:52,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 260 states have (on average 1.75) internal successors, (455), 305 states have internal predecessors, (455), 0 states have call successors, (0), 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 14:23:52,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 455 transitions. [2022-12-14 14:23:52,478 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 455 transitions. Word has length 25 [2022-12-14 14:23:52,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:23:52,478 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 455 transitions. [2022-12-14 14:23:52,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) 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 14:23:52,478 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 455 transitions. [2022-12-14 14:23:52,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 14:23:52,478 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:23:52,478 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:23:52,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-14 14:23:52,479 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:23:52,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:23:52,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1734713911, now seen corresponding path program 1 times [2022-12-14 14:23:52,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:23:52,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587212433] [2022-12-14 14:23:52,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:23:52,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:23:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:23:52,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:23:52,809 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:23:52,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587212433] [2022-12-14 14:23:52,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587212433] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:23:52,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023770924] [2022-12-14 14:23:52,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:23:52,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:23:52,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a13c396f-9da5-40a6-bed3-69934c130c27/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:23:52,811 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a13c396f-9da5-40a6-bed3-69934c130c27/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:23:52,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a13c396f-9da5-40a6-bed3-69934c130c27/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 14:23:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:23:52,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 14:23:52,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:23:52,923 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 14:23:52,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:23:52,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:23:52,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:52,968 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 14:23:52,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:52,973 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 14:23:52,979 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:23:52,980 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 14:23:53,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:53,006 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 14:23:53,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:53,011 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 14:23:53,087 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:23:53,087 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2022-12-14 14:23:53,090 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 20 treesize of output 22 [2022-12-14 14:23:53,113 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:23:53,113 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 14:23:53,143 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 24 treesize of output 24 [2022-12-14 14:23:53,150 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 14:23:53,218 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:23:53,219 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2022-12-14 14:23:53,223 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 20 treesize of output 22 [2022-12-14 14:23:53,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:23:53,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:23:53,307 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1200 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1200) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (forall ((v_ArrVal_1199 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1199) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0))) is different from false [2022-12-14 14:23:53,314 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)))) (and (forall ((v_ArrVal_1200 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1200) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (forall ((v_ArrVal_1199 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1199) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)))) is different from false [2022-12-14 14:23:53,762 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:23:53,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 136 [2022-12-14 14:23:54,163 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:23:54,163 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 57 [2022-12-14 14:23:54,166 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:23:54,169 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:23:54,169 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 1 case distinctions, treesize of input 266 treesize of output 164 [2022-12-14 14:23:54,176 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:23:54,176 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 133 treesize of output 105 [2022-12-14 14:23:54,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 105 treesize of output 97 [2022-12-14 14:23:54,206 INFO L321 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-12-14 14:23:54,206 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 1 [2022-12-14 14:23:54,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:23:54,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023770924] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:23:54,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [444182283] [2022-12-14 14:23:54,252 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-12-14 14:23:54,253 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:23:54,253 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:23:54,253 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:23:54,253 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:23:54,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,272 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 14:23:54,286 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 14:23:54,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,293 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 14:23:54,299 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 14:23:54,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,312 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 14:23:54,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,320 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 14:23:54,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,332 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 29 treesize of output 35 [2022-12-14 14:23:54,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,342 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 34 treesize of output 21 [2022-12-14 14:23:54,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,356 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 34 treesize of output 21 [2022-12-14 14:23:54,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-12-14 14:23:54,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 32 [2022-12-14 14:23:54,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,417 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 14:23:54,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 221 treesize of output 145 [2022-12-14 14:23:54,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 116 [2022-12-14 14:23:54,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,444 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 68 treesize of output 21 [2022-12-14 14:23:54,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,494 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 63 treesize of output 64 [2022-12-14 14:23:54,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,548 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 14:23:54,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,588 INFO L321 Elim1Store]: treesize reduction 188, result has 5.5 percent of original size [2022-12-14 14:23:54,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 294 treesize of output 193 [2022-12-14 14:23:54,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,606 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 14:23:54,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 125 [2022-12-14 14:23:54,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,654 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-12-14 14:23:54,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 332 treesize of output 213 [2022-12-14 14:23:54,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 123 [2022-12-14 14:23:54,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:54,691 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 48 treesize of output 21 [2022-12-14 14:23:54,865 INFO L321 Elim1Store]: treesize reduction 180, result has 16.7 percent of original size [2022-12-14 14:23:54,865 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 590 treesize of output 580 [2022-12-14 14:23:55,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:55,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:55,067 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:23:55,130 INFO L321 Elim1Store]: treesize reduction 290, result has 9.7 percent of original size [2022-12-14 14:23:55,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 22 case distinctions, treesize of input 814 treesize of output 534 [2022-12-14 14:23:55,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:55,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:55,148 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:23:55,256 INFO L321 Elim1Store]: treesize reduction 356, result has 9.4 percent of original size [2022-12-14 14:23:55,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 22 case distinctions, treesize of input 874 treesize of output 741 [2022-12-14 14:23:55,288 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-12-14 14:23:55,289 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 805 treesize of output 788 [2022-12-14 14:23:55,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:55,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:55,407 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:23:55,530 INFO L321 Elim1Store]: treesize reduction 372, result has 18.2 percent of original size [2022-12-14 14:23:55,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 969 treesize of output 610 [2022-12-14 14:23:55,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:55,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:55,553 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:23:55,686 INFO L321 Elim1Store]: treesize reduction 446, result has 12.7 percent of original size [2022-12-14 14:23:55,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 845 treesize of output 720 [2022-12-14 14:23:55,743 INFO L321 Elim1Store]: treesize reduction 128, result has 10.5 percent of original size [2022-12-14 14:23:55,743 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 675 treesize of output 628 [2022-12-14 14:23:56,452 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 14:23:56,456 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 14:23:56,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:56,486 INFO L321 Elim1Store]: treesize reduction 63, result has 17.1 percent of original size [2022-12-14 14:23:56,486 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 72 [2022-12-14 14:23:56,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:56,499 INFO L321 Elim1Store]: treesize reduction 63, result has 17.1 percent of original size [2022-12-14 14:23:56,500 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 66 [2022-12-14 14:23:56,505 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 14:23:56,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:56,564 INFO L321 Elim1Store]: treesize reduction 76, result has 42.9 percent of original size [2022-12-14 14:23:56,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 180 treesize of output 155 [2022-12-14 14:23:56,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:56,616 INFO L321 Elim1Store]: treesize reduction 52, result has 46.4 percent of original size [2022-12-14 14:23:56,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 142 treesize of output 123 [2022-12-14 14:23:56,625 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 14:23:56,852 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 14:23:56,857 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 14:23:56,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 14:23:56,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:56,897 INFO L321 Elim1Store]: treesize reduction 63, result has 17.1 percent of original size [2022-12-14 14:23:56,897 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 72 [2022-12-14 14:23:56,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:23:56,920 INFO L321 Elim1Store]: treesize reduction 63, result has 17.1 percent of original size [2022-12-14 14:23:56,920 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 66 [2022-12-14 14:23:56,927 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 14:23:59,403 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '22106#(and (or (and (<= 0 |#NULL.base|) (exists ((|v_ULTIMATE.start_main_~tmp~0#1.base_108| Int) (|v_ULTIMATE.start_main_~tmp~0#1.offset_89| Int)) (and (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmp~0#1.base_108|) |v_ULTIMATE.start_main_~tmp~0#1.offset_89|) |ULTIMATE.start_main_~tmp~0#1.base|) (= |ULTIMATE.start_main_~tmp~0#1.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~tmp~0#1.base_108|) |v_ULTIMATE.start_main_~tmp~0#1.offset_89|)) (= (select |#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_108|) 1) (<= 0 |v_ULTIMATE.start_main_~tmp~0#1.offset_89|) (<= (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_89| 4) (select |#length| |v_ULTIMATE.start_main_~tmp~0#1.base_108|)))) (<= 0 |ULTIMATE.start_main_~tree~0#1.offset|) (<= |#NULL.offset| 0) (<= |#NULL.base| 0) (<= |ULTIMATE.start_main_~tree~0#1.offset| 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|)) (and (<= 0 |#NULL.base|) (<= 0 |ULTIMATE.start_main_~tree~0#1.offset|) (= |ULTIMATE.start_main_~tmp~0#1.offset| |ULTIMATE.start_main_~tree~0#1.offset|) (<= |#NULL.offset| 0) (<= |#NULL.base| 0) (= |ULTIMATE.start_main_~tmp~0#1.base| |ULTIMATE.start_main_~tree~0#1.base|) (<= |ULTIMATE.start_main_~tree~0#1.offset| 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|))) (not (= (select |#valid| |ULTIMATE.start_main_~tmp~0#1.base|) 1)))' at error location [2022-12-14 14:23:59,403 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 14:23:59,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:23:59,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 13] total 29 [2022-12-14 14:23:59,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712759145] [2022-12-14 14:23:59,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:23:59,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-14 14:23:59,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:23:59,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-14 14:23:59,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1970, Unknown=30, NotChecked=186, Total=2450 [2022-12-14 14:23:59,405 INFO L87 Difference]: Start difference. First operand 306 states and 455 transitions. Second operand has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 29 states have internal predecessors, (60), 0 states have call successors, (0), 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 14:24:01,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:24:01,465 INFO L93 Difference]: Finished difference Result 889 states and 1216 transitions. [2022-12-14 14:24:01,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 14:24:01,465 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 29 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 14:24:01,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:24:01,466 INFO L225 Difference]: With dead ends: 889 [2022-12-14 14:24:01,466 INFO L226 Difference]: Without dead ends: 889 [2022-12-14 14:24:01,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=392, Invalid=3006, Unknown=32, NotChecked=230, Total=3660 [2022-12-14 14:24:01,467 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 635 mSDsluCounter, 2006 mSDsCounter, 0 mSdLazyCounter, 1969 mSolverCounterSat, 67 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 2143 SdHoareTripleChecker+Invalid, 2817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1969 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 780 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-14 14:24:01,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 2143 Invalid, 2817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1969 Invalid, 1 Unknown, 780 Unchecked, 1.7s Time] [2022-12-14 14:24:01,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2022-12-14 14:24:01,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 324. [2022-12-14 14:24:01,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 278 states have (on average 1.7158273381294964) internal successors, (477), 323 states have internal predecessors, (477), 0 states have call successors, (0), 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 14:24:01,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 477 transitions. [2022-12-14 14:24:01,471 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 477 transitions. Word has length 26 [2022-12-14 14:24:01,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:24:01,472 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 477 transitions. [2022-12-14 14:24:01,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 29 states have internal predecessors, (60), 0 states have call successors, (0), 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 14:24:01,472 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 477 transitions. [2022-12-14 14:24:01,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 14:24:01,472 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:24:01,472 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:24:01,477 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a13c396f-9da5-40a6-bed3-69934c130c27/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 14:24:01,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a13c396f-9da5-40a6-bed3-69934c130c27/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-12-14 14:24:01,673 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:24:01,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:24:01,674 INFO L85 PathProgramCache]: Analyzing trace with hash 541635711, now seen corresponding path program 1 times [2022-12-14 14:24:01,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:24:01,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321214330] [2022-12-14 14:24:01,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:24:01,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:24:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:24:01,749 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 14:24:01,749 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:24:01,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321214330] [2022-12-14 14:24:01,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321214330] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:24:01,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:24:01,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 14:24:01,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568440124] [2022-12-14 14:24:01,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:24:01,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:24:01,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:24:01,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:24:01,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:24:01,750 INFO L87 Difference]: Start difference. First operand 324 states and 477 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:24:01,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:24:01,889 INFO L93 Difference]: Finished difference Result 323 states and 473 transitions. [2022-12-14 14:24:01,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 14:24:01,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 14:24:01,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:24:01,890 INFO L225 Difference]: With dead ends: 323 [2022-12-14 14:24:01,890 INFO L226 Difference]: Without dead ends: 323 [2022-12-14 14:24:01,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 14:24:01,891 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 22 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:24:01,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 237 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:24:01,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-12-14 14:24:01,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2022-12-14 14:24:01,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 278 states have (on average 1.7014388489208634) internal successors, (473), 322 states have internal predecessors, (473), 0 states have call successors, (0), 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 14:24:01,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 473 transitions. [2022-12-14 14:24:01,894 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 473 transitions. Word has length 26 [2022-12-14 14:24:01,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:24:01,894 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 473 transitions. [2022-12-14 14:24:01,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:24:01,894 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 473 transitions. [2022-12-14 14:24:01,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 14:24:01,895 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:24:01,895 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:24:01,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-14 14:24:01,895 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:24:01,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:24:01,895 INFO L85 PathProgramCache]: Analyzing trace with hash 542741986, now seen corresponding path program 1 times [2022-12-14 14:24:01,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:24:01,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498518648] [2022-12-14 14:24:01,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:24:01,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:24:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:24:02,120 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 14:24:02,121 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:24:02,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498518648] [2022-12-14 14:24:02,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498518648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:24:02,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:24:02,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-14 14:24:02,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129279480] [2022-12-14 14:24:02,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:24:02,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 14:24:02,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:24:02,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 14:24:02,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-12-14 14:24:02,122 INFO L87 Difference]: Start difference. First operand 323 states and 473 transitions. Second operand has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:24:02,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:24:02,780 INFO L93 Difference]: Finished difference Result 567 states and 790 transitions. [2022-12-14 14:24:02,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 14:24:02,780 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 14:24:02,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:24:02,781 INFO L225 Difference]: With dead ends: 567 [2022-12-14 14:24:02,781 INFO L226 Difference]: Without dead ends: 567 [2022-12-14 14:24:02,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2022-12-14 14:24:02,782 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 415 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:24:02,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 894 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1355 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 14:24:02,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2022-12-14 14:24:02,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 327. [2022-12-14 14:24:02,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 282 states have (on average 1.6950354609929077) internal successors, (478), 326 states have internal predecessors, (478), 0 states have call successors, (0), 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 14:24:02,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 478 transitions. [2022-12-14 14:24:02,785 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 478 transitions. Word has length 26 [2022-12-14 14:24:02,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:24:02,786 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 478 transitions. [2022-12-14 14:24:02,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:24:02,786 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 478 transitions. [2022-12-14 14:24:02,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 14:24:02,786 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:24:02,786 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:24:02,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-14 14:24:02,786 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:24:02,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:24:02,786 INFO L85 PathProgramCache]: Analyzing trace with hash 542741987, now seen corresponding path program 1 times [2022-12-14 14:24:02,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:24:02,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754730627] [2022-12-14 14:24:02,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:24:02,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:24:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:24:03,008 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 14:24:03,008 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:24:03,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754730627] [2022-12-14 14:24:03,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754730627] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:24:03,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:24:03,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 14:24:03,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198811813] [2022-12-14 14:24:03,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:24:03,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 14:24:03,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:24:03,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 14:24:03,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-14 14:24:03,009 INFO L87 Difference]: Start difference. First operand 327 states and 478 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:24:03,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:24:03,530 INFO L93 Difference]: Finished difference Result 443 states and 640 transitions. [2022-12-14 14:24:03,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 14:24:03,530 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 14:24:03,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:24:03,531 INFO L225 Difference]: With dead ends: 443 [2022-12-14 14:24:03,531 INFO L226 Difference]: Without dead ends: 443 [2022-12-14 14:24:03,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2022-12-14 14:24:03,532 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 214 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:24:03,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 782 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 14:24:03,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-12-14 14:24:03,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 323. [2022-12-14 14:24:03,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 278 states have (on average 1.6978417266187051) internal successors, (472), 322 states have internal predecessors, (472), 0 states have call successors, (0), 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 14:24:03,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 472 transitions. [2022-12-14 14:24:03,535 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 472 transitions. Word has length 26 [2022-12-14 14:24:03,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:24:03,535 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 472 transitions. [2022-12-14 14:24:03,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:24:03,535 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 472 transitions. [2022-12-14 14:24:03,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 14:24:03,535 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:24:03,535 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:24:03,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-14 14:24:03,535 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 14:24:03,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:24:03,536 INFO L85 PathProgramCache]: Analyzing trace with hash -516582066, now seen corresponding path program 1 times [2022-12-14 14:24:03,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:24:03,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532483763] [2022-12-14 14:24:03,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:24:03,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:24:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:24:03,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:24:03,826 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:24:03,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532483763] [2022-12-14 14:24:03,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532483763] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:24:03,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844551821] [2022-12-14 14:24:03,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:24:03,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:24:03,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a13c396f-9da5-40a6-bed3-69934c130c27/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:24:03,828 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a13c396f-9da5-40a6-bed3-69934c130c27/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:24:03,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a13c396f-9da5-40a6-bed3-69934c130c27/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 14:24:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:24:03,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-14 14:24:03,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:24:03,918 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 14:24:03,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:24:03,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:24:03,963 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:24:03,963 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 14:24:03,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:03,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 14:24:03,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:03,974 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 14:24:04,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:04,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:04,005 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 32 [2022-12-14 14:24:04,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:04,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:04,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 32 [2022-12-14 14:24:04,108 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:24:04,108 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2022-12-14 14:24:04,111 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 29 treesize of output 29 [2022-12-14 14:24:04,146 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:24:04,146 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 14:24:04,267 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 23 [2022-12-14 14:24:04,273 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 44 treesize of output 40 [2022-12-14 14:24:04,368 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 14:24:04,368 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2022-12-14 14:24:04,372 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 29 treesize of output 29 [2022-12-14 14:24:04,534 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-14 14:24:04,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:24:04,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:24:04,696 WARN L837 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1387 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1387) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|)) 1)) (forall ((v_ArrVal_1386 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1386) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0))) (forall ((v_ArrVal_1387 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1387) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= .cse0 0) (= (select |c_#valid| .cse0) 1))))) is different from false [2022-12-14 14:24:04,707 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8)))) (and (or (forall ((v_ArrVal_1386 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1386) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (forall ((v_ArrVal_1387 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1387) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|)) 1))) (forall ((v_ArrVal_1387 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1387) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= (select |c_#valid| .cse1) 1) (= .cse1 0)))))) is different from false [2022-12-14 14:24:04,721 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (and (forall ((v_ArrVal_1387 (Array Int Int)) (v_ArrVal_1384 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1384))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_ArrVal_1387)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= .cse0 0) (= (select |c_#valid| .cse0) 1)))) (forall ((v_ArrVal_1385 (Array Int Int)) (v_ArrVal_1384 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1384))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))) (or (forall ((v_ArrVal_1386 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1385) .cse3 v_ArrVal_1386) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (forall ((v_ArrVal_1387 (Array Int Int))) (= (select |c_#valid| (select (select (store .cse4 .cse3 v_ArrVal_1387) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|)) 1)))))))) is different from false [2022-12-14 14:24:04,743 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:24:04,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 158 [2022-12-14 14:24:04,892 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (and (forall ((v_prenex_10 (Array Int Int)) (v_prenex_11 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_11))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))) (let ((.cse1 (select (select (store .cse5 .cse4 v_prenex_10) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (forall ((v_ArrVal_1387 (Array Int Int)) (v_ArrVal_1384 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1384))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_1387)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= |c_ULTIMATE.start_main_#t~mem9#1.base| .cse0) (= .cse1 .cse0)))) (forall ((v_ArrVal_1386 (Array Int Int)) (v_ArrVal_1385 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1385) .cse4 v_ArrVal_1386) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_#t~mem9#1.base| .cse1)))))) (or (forall ((v_ArrVal_1387 (Array Int Int)) (v_ArrVal_1384 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1384))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_1387)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (forall ((v_prenex_10 (Array Int Int)) (v_ArrVal_1386 (Array Int Int)) (v_ArrVal_1385 (Array Int Int)) (v_prenex_11 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_11))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (store .cse7 .cse8 v_prenex_10) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1385) .cse8 v_ArrVal_1386) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)))))) (forall ((v_prenex_10 (Array Int Int)) (v_prenex_11 (Array Int Int))) (let ((.cse10 (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_11))) (store .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_prenex_10)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (forall ((v_ArrVal_1387 (Array Int Int)) (v_ArrVal_1384 (Array Int Int))) (let ((.cse9 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1384))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_1387)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= .cse9 0) (= |c_ULTIMATE.start_main_#t~mem9#1.base| .cse9) (= .cse10 .cse9)))) (= |c_ULTIMATE.start_main_#t~mem9#1.base| .cse10)))) (forall ((v_prenex_10 (Array Int Int)) (v_ArrVal_1387 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_1384 (Array Int Int))) (let ((.cse13 (select (select (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1384))) (store .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_1387)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= .cse13 0) (= |c_ULTIMATE.start_main_#t~mem9#1.base| .cse13) (= (select (select (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_11))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_prenex_10)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) .cse13)))) (or (forall ((v_ArrVal_1387 (Array Int Int)) (v_ArrVal_1384 (Array Int Int))) (let ((.cse16 (select (select (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1384))) (store .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_1387)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= .cse16 0) (= |c_ULTIMATE.start_main_#t~mem9#1.base| .cse16)))) (forall ((v_prenex_10 (Array Int Int)) (v_prenex_11 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_11))) (store .cse18 (select (select .cse18 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_prenex_10)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_prenex_10 (Array Int Int)) (v_prenex_11 (Array Int Int))) (let ((.cse22 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_11))) (let ((.cse19 (select (select .cse22 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))) (let ((.cse20 (select (select (store .cse22 .cse19 v_prenex_10) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (forall ((v_ArrVal_1386 (Array Int Int)) (v_ArrVal_1385 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1385) .cse19 v_ArrVal_1386) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_#t~mem9#1.base| .cse20) (forall ((v_ArrVal_1387 (Array Int Int)) (v_ArrVal_1384 (Array Int Int))) (= .cse20 (select (select (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1384))) (store .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_1387)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|)))))))))) is different from false [2022-12-14 14:24:04,967 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))) (and (or (forall ((v_ArrVal_1387 (Array Int Int)) (v_ArrVal_1384 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1384))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_1387)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= .cse0 0) (= .cse1 .cse0)))) (forall ((v_prenex_10 (Array Int Int)) (v_prenex_11 (Array Int Int))) (= .cse1 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_11))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_prenex_10)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|)))) (forall ((v_prenex_10 (Array Int Int)) (v_ArrVal_1387 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_1384 (Array Int Int))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1384))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_1387)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= .cse5 0) (= (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_11))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_prenex_10)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) .cse5) (= .cse1 .cse5)))) (forall ((v_prenex_10 (Array Int Int)) (v_prenex_11 (Array Int Int))) (let ((.cse9 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_11))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_prenex_10)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (forall ((v_ArrVal_1387 (Array Int Int)) (v_ArrVal_1384 (Array Int Int))) (let ((.cse8 (select (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1384))) (store .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_1387)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= .cse8 0) (= .cse9 .cse8) (= .cse1 .cse8)))) (= .cse1 .cse9)))) (forall ((v_prenex_10 (Array Int Int)) (v_prenex_11 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_11))) (let ((.cse13 (select (select .cse15 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))) (let ((.cse12 (select (select (store .cse15 .cse13 v_prenex_10) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= .cse1 .cse12) (forall ((v_ArrVal_1386 (Array Int Int)) (v_ArrVal_1385 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1385) .cse13 v_ArrVal_1386) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (forall ((v_ArrVal_1387 (Array Int Int)) (v_ArrVal_1384 (Array Int Int))) (= .cse12 (select (select (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1384))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_1387)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|)))))))) (forall ((v_prenex_10 (Array Int Int)) (v_prenex_11 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_11))) (let ((.cse19 (select (select .cse20 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))) (let ((.cse16 (select (select (store .cse20 .cse19 v_prenex_10) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= .cse1 .cse16) (forall ((v_ArrVal_1387 (Array Int Int)) (v_ArrVal_1384 (Array Int Int))) (let ((.cse17 (select (select (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1384))) (store .cse18 (select (select .cse18 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_1387)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= .cse16 .cse17) (= .cse1 .cse17)))) (forall ((v_ArrVal_1386 (Array Int Int)) (v_ArrVal_1385 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1385) .cse19 v_ArrVal_1386) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0))))))) (or (forall ((v_ArrVal_1387 (Array Int Int)) (v_ArrVal_1384 (Array Int Int))) (= .cse1 (select (select (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1384))) (store .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_1387)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (forall ((v_prenex_10 (Array Int Int)) (v_ArrVal_1386 (Array Int Int)) (v_ArrVal_1385 (Array Int Int)) (v_prenex_11 (Array Int Int))) (let ((.cse22 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_11))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))) (or (= .cse1 (select (select (store .cse22 .cse23 v_prenex_10) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1385) .cse23 v_ArrVal_1386) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0))))))))) is different from false [2022-12-14 14:24:05,971 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:24:05,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 386 treesize of output 404 [2022-12-14 14:24:06,211 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~malloc4#1.base|)))) (and (forall ((v_ArrVal_1381 Int) (|v_ULTIMATE.start_main_~tmpList~0#1.base_41| Int) (v_prenex_10 (Array Int Int)) (v_ArrVal_1387 (Array Int Int)) (v_ArrVal_1386 (Array Int Int)) (v_ArrVal_1385 (Array Int Int)) (v_prenex_11 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse3 (store .cse6 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1382))) (let ((.cse4 (store .cse3 |v_ULTIMATE.start_main_~tmpList~0#1.base_41| v_prenex_11))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2)) (.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2))) (or (= .cse0 (select (select (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~tmpList~0#1.base_41| v_ArrVal_1384))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_ArrVal_1387)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|)) (= |v_ULTIMATE.start_main_~tmpList~0#1.base_41| |c_ULTIMATE.start_main_~tree~0#1.base|) (= .cse0 (select (select (store .cse4 .cse5 v_prenex_10) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|)) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2 v_ArrVal_1381)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1383) |v_ULTIMATE.start_main_~tmpList~0#1.base_41| v_ArrVal_1385) .cse5 v_ArrVal_1386) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)))))) (forall ((v_prenex_88 Int)) (or (forall ((v_prenex_93 (Array Int Int)) (v_prenex_92 (Array Int Int)) (v_prenex_91 (Array Int Int)) (v_prenex_89 (Array Int Int)) (v_prenex_90 (Array Int Int))) (let ((.cse10 (store .cse6 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_93))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2)) (.cse8 (select (select (let ((.cse11 (store .cse10 v_prenex_88 v_prenex_92))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_prenex_90)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= .cse7 .cse8) (= .cse7 (select (select (let ((.cse9 (store .cse10 v_prenex_88 v_prenex_91))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_prenex_89)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|)) (= .cse8 0))))) (= v_prenex_88 |c_ULTIMATE.start_main_~tree~0#1.base|)))))) is different from false [2022-12-14 14:24:07,821 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:24:07,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 75 [2022-12-14 14:24:07,835 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:24:07,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 229 treesize of output 131 [2022-12-14 14:24:07,839 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:24:07,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1140 treesize of output 678 [2022-12-14 14:24:07,861 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:24:07,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 280 treesize of output 254 [2022-12-14 14:24:07,891 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:24:07,892 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 198 treesize of output 112 [2022-12-14 14:24:07,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 46 treesize of output 42 [2022-12-14 14:24:07,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 50 treesize of output 46 [2022-12-14 14:24:07,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 46 treesize of output 42 [2022-12-14 14:24:07,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 7 [2022-12-14 14:24:07,927 INFO L321 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-12-14 14:24:07,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 247 treesize of output 1 [2022-12-14 14:24:07,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:24:07,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844551821] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:24:07,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [956909202] [2022-12-14 14:24:07,987 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2022-12-14 14:24:07,987 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 14:24:07,987 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 14:24:07,987 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 14:24:07,987 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 14:24:07,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,001 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 14:24:08,009 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 14:24:08,014 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 14:24:08,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,021 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 14:24:08,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,034 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 14:24:08,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,044 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 29 treesize of output 35 [2022-12-14 14:24:08,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,053 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 34 treesize of output 21 [2022-12-14 14:24:08,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,060 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 14:24:08,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-12-14 14:24:08,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,084 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 34 treesize of output 21 [2022-12-14 14:24:08,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 32 [2022-12-14 14:24:08,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,129 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 14:24:08,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 221 treesize of output 145 [2022-12-14 14:24:08,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 116 [2022-12-14 14:24:08,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,151 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 60 treesize of output 21 [2022-12-14 14:24:08,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,187 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 59 treesize of output 60 [2022-12-14 14:24:08,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,214 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 14:24:08,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,238 INFO L321 Elim1Store]: treesize reduction 31, result has 29.5 percent of original size [2022-12-14 14:24:08,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 247 treesize of output 170 [2022-12-14 14:24:08,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 93 [2022-12-14 14:24:08,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,306 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-12-14 14:24:08,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 291 treesize of output 191 [2022-12-14 14:24:08,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,328 INFO L321 Elim1Store]: treesize reduction 35, result has 2.8 percent of original size [2022-12-14 14:24:08,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 123 [2022-12-14 14:24:08,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,340 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 48 treesize of output 21 [2022-12-14 14:24:08,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 19 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 82 [2022-12-14 14:24:08,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,465 INFO L321 Elim1Store]: treesize reduction 161, result has 10.1 percent of original size [2022-12-14 14:24:08,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 458 treesize of output 251 [2022-12-14 14:24:08,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,494 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 14:24:08,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 132 [2022-12-14 14:24:08,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,511 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 14:24:08,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,591 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:24:08,592 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:24:08,683 INFO L321 Elim1Store]: treesize reduction 199, result has 20.7 percent of original size [2022-12-14 14:24:08,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 801 treesize of output 594 [2022-12-14 14:24:08,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:08,711 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:24:08,711 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:24:08,795 INFO L321 Elim1Store]: treesize reduction 277, result has 13.7 percent of original size [2022-12-14 14:24:08,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 773 treesize of output 722 [2022-12-14 14:24:08,840 INFO L321 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2022-12-14 14:24:08,841 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 747 treesize of output 730 [2022-12-14 14:24:09,317 INFO L321 Elim1Store]: treesize reduction 276, result has 12.9 percent of original size [2022-12-14 14:24:09,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 1273 treesize of output 1216 [2022-12-14 14:24:09,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:09,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:09,621 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:24:09,701 INFO L321 Elim1Store]: treesize reduction 236, result has 10.6 percent of original size [2022-12-14 14:24:09,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 2865 treesize of output 1055 [2022-12-14 14:24:09,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:09,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:09,724 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:24:09,869 INFO L321 Elim1Store]: treesize reduction 236, result has 10.6 percent of original size [2022-12-14 14:24:09,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 2859 treesize of output 1843 [2022-12-14 14:24:09,940 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-12-14 14:24:09,940 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 2796 treesize of output 2771 [2022-12-14 14:24:10,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:24:10,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:24:10,060 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 14:24:10,082 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 14:24:10,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 14:24:10,087 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 14 treesize of output 16 [2022-12-14 14:24:10,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:10,125 INFO L321 Elim1Store]: treesize reduction 63, result has 17.1 percent of original size [2022-12-14 14:24:10,126 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 72 [2022-12-14 14:24:10,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:24:10,151 INFO L321 Elim1Store]: treesize reduction 95, result has 12.0 percent of original size [2022-12-14 14:24:10,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 86 treesize of output 76 [2022-12-14 14:24:10,160 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 14:24:10,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:24:10,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 14:24:10,183 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 14:24:10,736 INFO L321 Elim1Store]: treesize reduction 100, result has 53.7 percent of original size [2022-12-14 14:24:10,736 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 330 treesize of output 418 [2022-12-14 14:24:12,143 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 14:24:12,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 143 treesize of output 145 [2022-12-14 14:24:12,182 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 14:24:12,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 14:24:12,222 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 14:24:12,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 14:24:12,265 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 14:24:12,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 133 [2022-12-14 14:24:12,308 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 14:24:12,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 14:24:12,342 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 14:24:12,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 14:24:12,385 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 14:24:12,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 137 treesize of output 139 [2022-12-14 14:24:12,446 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 14:24:12,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 311 treesize of output 309 [2022-12-14 14:24:12,531 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 14:24:12,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 14:24:12,597 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 14:24:12,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 14:24:12,640 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 14:24:12,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 14:24:12,670 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 14:24:12,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 14:24:12,715 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 14:24:12,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 14:24:12,758 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 14:24:12,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 141 treesize of output 143 [2022-12-14 14:24:12,806 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 14:24:12,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 14:24:12,842 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 14:24:12,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 14:24:12,870 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 14:24:12,879 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 14:24:12,904 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 14:24:12,921 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 14:24:16,202 INFO L321 Elim1Store]: treesize reduction 184, result has 17.5 percent of original size [2022-12-14 14:24:16,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 5127 treesize of output 3894 [2022-12-14 14:24:58,897 WARN L233 SmtUtils]: Spent 42.58s on a formula simplification. DAG size of input: 2369 DAG size of output: 1914 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-12-14 14:24:58,902 INFO L321 Elim1Store]: treesize reduction 1472, result has 72.3 percent of original size [2022-12-14 14:24:58,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 27 select indices, 27 select index equivalence classes, 4 disjoint index pairs (out of 351 index pairs), introduced 28 new quantified variables, introduced 375 case distinctions, treesize of input 4977 treesize of output 8227 [2022-12-14 14:24:59,803 INFO L321 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2022-12-14 14:24:59,804 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 4822 treesize of output 4729