./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccf03799-d2f2-4db5-b937-b5bc561cfd5d/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccf03799-d2f2-4db5-b937-b5bc561cfd5d/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_ccf03799-d2f2-4db5-b937-b5bc561cfd5d/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccf03799-d2f2-4db5-b937-b5bc561cfd5d/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lhb-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccf03799-d2f2-4db5-b937-b5bc561cfd5d/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_ccf03799-d2f2-4db5-b937-b5bc561cfd5d/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 de5a591efb40e891e226106d8590a7409596f3a27aca8b697af826abd4fe5201 --- 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 13:35:08,503 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 13:35:08,504 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 13:35:08,522 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 13:35:08,523 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 13:35:08,524 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 13:35:08,525 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 13:35:08,526 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 13:35:08,527 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 13:35:08,528 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 13:35:08,529 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 13:35:08,530 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 13:35:08,530 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 13:35:08,531 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 13:35:08,532 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 13:35:08,533 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 13:35:08,534 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 13:35:08,535 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 13:35:08,536 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 13:35:08,538 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 13:35:08,539 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 13:35:08,541 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 13:35:08,542 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 13:35:08,542 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 13:35:08,545 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 13:35:08,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 13:35:08,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 13:35:08,547 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 13:35:08,547 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 13:35:08,548 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 13:35:08,548 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 13:35:08,549 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 13:35:08,550 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 13:35:08,550 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 13:35:08,551 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 13:35:08,551 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 13:35:08,552 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 13:35:08,552 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 13:35:08,552 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 13:35:08,553 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 13:35:08,553 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 13:35:08,554 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccf03799-d2f2-4db5-b937-b5bc561cfd5d/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-12-14 13:35:08,575 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 13:35:08,575 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 13:35:08,575 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 13:35:08,576 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 13:35:08,576 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 13:35:08,576 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 13:35:08,577 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 13:35:08,577 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 13:35:08,577 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 13:35:08,577 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 13:35:08,577 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 13:35:08,577 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 13:35:08,578 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 13:35:08,578 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 13:35:08,578 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 13:35:08,578 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 13:35:08,578 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 13:35:08,578 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 13:35:08,579 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 13:35:08,579 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 13:35:08,579 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 13:35:08,580 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 13:35:08,580 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 13:35:08,580 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 13:35:08,580 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 13:35:08,580 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 13:35:08,580 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 13:35:08,580 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 13:35:08,581 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 13:35:08,581 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 13:35:08,581 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 13:35:08,581 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 13:35:08,581 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 13:35:08,581 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 13:35:08,581 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 13:35:08,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 13:35:08,582 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 13:35:08,582 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 13:35:08,582 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 13:35:08,582 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 13:35:08,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 13:35:08,583 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 13:35:08,583 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_ccf03799-d2f2-4db5-b937-b5bc561cfd5d/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_ccf03799-d2f2-4db5-b937-b5bc561cfd5d/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 -> de5a591efb40e891e226106d8590a7409596f3a27aca8b697af826abd4fe5201 [2022-12-14 13:35:08,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 13:35:08,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 13:35:08,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 13:35:08,779 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 13:35:08,779 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 13:35:08,780 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccf03799-d2f2-4db5-b937-b5bc561cfd5d/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lhb-reducer.c [2022-12-14 13:35:11,283 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 13:35:11,481 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 13:35:11,482 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccf03799-d2f2-4db5-b937-b5bc561cfd5d/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lhb-reducer.c [2022-12-14 13:35:11,490 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccf03799-d2f2-4db5-b937-b5bc561cfd5d/bin/utaipan-gh47qXpMRh/data/ff45601ed/cf16bff50b8b48c5b63049af25a818bc/FLAG68d10a806 [2022-12-14 13:35:11,870 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccf03799-d2f2-4db5-b937-b5bc561cfd5d/bin/utaipan-gh47qXpMRh/data/ff45601ed/cf16bff50b8b48c5b63049af25a818bc [2022-12-14 13:35:11,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 13:35:11,873 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 13:35:11,874 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 13:35:11,874 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 13:35:11,876 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 13:35:11,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:35:11" (1/1) ... [2022-12-14 13:35:11,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26c44dbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:11, skipping insertion in model container [2022-12-14 13:35:11,878 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:35:11" (1/1) ... [2022-12-14 13:35:11,883 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 13:35:11,904 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 13:35:12,071 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccf03799-d2f2-4db5-b937-b5bc561cfd5d/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lhb-reducer.c[15516,15529] [2022-12-14 13:35:12,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 13:35:12,086 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 13:35:12,138 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccf03799-d2f2-4db5-b937-b5bc561cfd5d/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lhb-reducer.c[15516,15529] [2022-12-14 13:35:12,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 13:35:12,152 INFO L208 MainTranslator]: Completed translation [2022-12-14 13:35:12,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:12 WrapperNode [2022-12-14 13:35:12,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 13:35:12,153 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 13:35:12,153 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 13:35:12,153 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 13:35:12,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:12" (1/1) ... [2022-12-14 13:35:12,169 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:12" (1/1) ... [2022-12-14 13:35:12,195 INFO L138 Inliner]: procedures = 17, calls = 293, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 772 [2022-12-14 13:35:12,195 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 13:35:12,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 13:35:12,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 13:35:12,196 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 13:35:12,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:12" (1/1) ... [2022-12-14 13:35:12,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:12" (1/1) ... [2022-12-14 13:35:12,207 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:12" (1/1) ... [2022-12-14 13:35:12,207 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:12" (1/1) ... [2022-12-14 13:35:12,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:12" (1/1) ... [2022-12-14 13:35:12,223 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:12" (1/1) ... [2022-12-14 13:35:12,225 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:12" (1/1) ... [2022-12-14 13:35:12,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:12" (1/1) ... [2022-12-14 13:35:12,231 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 13:35:12,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 13:35:12,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 13:35:12,232 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 13:35:12,233 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:12" (1/1) ... [2022-12-14 13:35:12,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 13:35:12,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccf03799-d2f2-4db5-b937-b5bc561cfd5d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:35:12,259 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccf03799-d2f2-4db5-b937-b5bc561cfd5d/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 13:35:12,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccf03799-d2f2-4db5-b937-b5bc561cfd5d/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 13:35:12,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 13:35:12,301 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2022-12-14 13:35:12,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 13:35:12,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 13:35:12,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 13:35:12,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 13:35:12,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 13:35:12,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 13:35:12,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 13:35:12,407 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 13:35:12,408 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 13:35:13,004 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 13:35:13,074 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 13:35:13,074 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 13:35:13,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:35:13 BoogieIcfgContainer [2022-12-14 13:35:13,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 13:35:13,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 13:35:13,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 13:35:13,082 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 13:35:13,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:35:11" (1/3) ... [2022-12-14 13:35:13,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5671ab2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:35:13, skipping insertion in model container [2022-12-14 13:35:13,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:12" (2/3) ... [2022-12-14 13:35:13,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5671ab2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:35:13, skipping insertion in model container [2022-12-14 13:35:13,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:35:13" (3/3) ... [2022-12-14 13:35:13,084 INFO L112 eAbstractionObserver]: Analyzing ICFG aiob_4.c.v+lhb-reducer.c [2022-12-14 13:35:13,101 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 13:35:13,101 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 104 error locations. [2022-12-14 13:35:13,142 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 13:35:13,148 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;@48943724, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 13:35:13,149 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2022-12-14 13:35:13,152 INFO L276 IsEmpty]: Start isEmpty. Operand has 202 states, 97 states have (on average 2.5051546391752577) internal successors, (243), 201 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:35:13,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 13:35:13,157 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:13,158 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 13:35:13,158 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 13:35:13,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:13,163 INFO L85 PathProgramCache]: Analyzing trace with hash 436861, now seen corresponding path program 1 times [2022-12-14 13:35:13,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:13,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581726560] [2022-12-14 13:35:13,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:13,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:13,437 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 13:35:13,437 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:13,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581726560] [2022-12-14 13:35:13,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581726560] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:13,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:13,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 13:35:13,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862524483] [2022-12-14 13:35:13,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:13,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:35:13,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:13,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:35:13,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:35:13,469 INFO L87 Difference]: Start difference. First operand has 202 states, 97 states have (on average 2.5051546391752577) internal successors, (243), 201 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:35:13,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:13,710 INFO L93 Difference]: Finished difference Result 203 states and 233 transitions. [2022-12-14 13:35:13,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 13:35:13,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-12-14 13:35:13,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:13,719 INFO L225 Difference]: With dead ends: 203 [2022-12-14 13:35:13,719 INFO L226 Difference]: Without dead ends: 201 [2022-12-14 13:35:13,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:35:13,723 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 124 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:13,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 295 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:35:13,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-12-14 13:35:13,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2022-12-14 13:35:13,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 97 states have (on average 2.3711340206185567) internal successors, (230), 200 states have internal predecessors, (230), 0 states have call successors, (0), 0 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 13:35:13,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 230 transitions. [2022-12-14 13:35:13,760 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 230 transitions. Word has length 3 [2022-12-14 13:35:13,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:13,761 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 230 transitions. [2022-12-14 13:35:13,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:35:13,761 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 230 transitions. [2022-12-14 13:35:13,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 13:35:13,761 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:13,761 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 13:35:13,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 13:35:13,761 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 13:35:13,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:13,762 INFO L85 PathProgramCache]: Analyzing trace with hash 436520, now seen corresponding path program 1 times [2022-12-14 13:35:13,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:13,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639123546] [2022-12-14 13:35:13,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:13,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:13,810 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 13:35:13,810 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:13,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639123546] [2022-12-14 13:35:13,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639123546] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:13,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:13,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 13:35:13,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117327538] [2022-12-14 13:35:13,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:13,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:35:13,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:13,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:35:13,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:35:13,812 INFO L87 Difference]: Start difference. First operand 201 states and 230 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:35:14,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:14,032 INFO L93 Difference]: Finished difference Result 160 states and 189 transitions. [2022-12-14 13:35:14,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 13:35:14,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-12-14 13:35:14,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:14,034 INFO L225 Difference]: With dead ends: 160 [2022-12-14 13:35:14,034 INFO L226 Difference]: Without dead ends: 160 [2022-12-14 13:35:14,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 13:35:14,035 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 311 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:14,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 55 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:35:14,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-12-14 13:35:14,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-12-14 13:35:14,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 97 states have (on average 1.9484536082474226) internal successors, (189), 159 states have internal predecessors, (189), 0 states have call successors, (0), 0 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 13:35:14,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 189 transitions. [2022-12-14 13:35:14,045 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 189 transitions. Word has length 3 [2022-12-14 13:35:14,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:14,045 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 189 transitions. [2022-12-14 13:35:14,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:35:14,046 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 189 transitions. [2022-12-14 13:35:14,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 13:35:14,046 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:14,046 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 13:35:14,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 13:35:14,047 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 13:35:14,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:14,048 INFO L85 PathProgramCache]: Analyzing trace with hash 436521, now seen corresponding path program 1 times [2022-12-14 13:35:14,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:14,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909672066] [2022-12-14 13:35:14,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:14,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:14,158 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 13:35:14,158 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:14,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909672066] [2022-12-14 13:35:14,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909672066] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:14,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:14,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 13:35:14,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005777132] [2022-12-14 13:35:14,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:14,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:35:14,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:14,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:35:14,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:35:14,160 INFO L87 Difference]: Start difference. First operand 160 states and 189 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:35:14,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:14,350 INFO L93 Difference]: Finished difference Result 119 states and 148 transitions. [2022-12-14 13:35:14,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:35:14,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-12-14 13:35:14,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:14,351 INFO L225 Difference]: With dead ends: 119 [2022-12-14 13:35:14,351 INFO L226 Difference]: Without dead ends: 119 [2022-12-14 13:35:14,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 13:35:14,352 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 186 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:14,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 140 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:35:14,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-12-14 13:35:14,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-12-14 13:35:14,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 97 states have (on average 1.5257731958762886) internal successors, (148), 118 states have internal predecessors, (148), 0 states have call successors, (0), 0 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 13:35:14,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 148 transitions. [2022-12-14 13:35:14,358 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 148 transitions. Word has length 3 [2022-12-14 13:35:14,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:14,358 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 148 transitions. [2022-12-14 13:35:14,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:35:14,358 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 148 transitions. [2022-12-14 13:35:14,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-14 13:35:14,359 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:14,359 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:35:14,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 13:35:14,359 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 13:35:14,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:14,360 INFO L85 PathProgramCache]: Analyzing trace with hash -625229061, now seen corresponding path program 1 times [2022-12-14 13:35:14,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:14,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251239832] [2022-12-14 13:35:14,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:14,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:14,612 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 13:35:14,612 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:14,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251239832] [2022-12-14 13:35:14,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251239832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:14,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:14,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:35:14,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025606199] [2022-12-14 13:35:14,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:14,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:35:14,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:14,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:35:14,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:35:14,615 INFO L87 Difference]: Start difference. First operand 119 states and 148 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 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 13:35:14,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:14,712 INFO L93 Difference]: Finished difference Result 121 states and 148 transitions. [2022-12-14 13:35:14,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:35:14,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2022-12-14 13:35:14,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:14,714 INFO L225 Difference]: With dead ends: 121 [2022-12-14 13:35:14,714 INFO L226 Difference]: Without dead ends: 121 [2022-12-14 13:35:14,714 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 13:35:14,721 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 49 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:14,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 163 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:35:14,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-12-14 13:35:14,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2022-12-14 13:35:14,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 97 states have (on average 1.5154639175257731) internal successors, (147), 118 states have internal predecessors, (147), 0 states have call successors, (0), 0 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 13:35:14,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 147 transitions. [2022-12-14 13:35:14,729 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 147 transitions. Word has length 46 [2022-12-14 13:35:14,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:14,729 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 147 transitions. [2022-12-14 13:35:14,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 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 13:35:14,730 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 147 transitions. [2022-12-14 13:35:14,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-14 13:35:14,731 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:14,731 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:35:14,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 13:35:14,731 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 13:35:14,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:14,732 INFO L85 PathProgramCache]: Analyzing trace with hash 2092506818, now seen corresponding path program 1 times [2022-12-14 13:35:14,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:14,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562319281] [2022-12-14 13:35:14,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:14,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:14,870 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 13:35:14,870 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:14,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562319281] [2022-12-14 13:35:14,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562319281] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:14,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:14,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:35:14,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260237130] [2022-12-14 13:35:14,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:14,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:35:14,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:14,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:35:14,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:35:14,873 INFO L87 Difference]: Start difference. First operand 119 states and 147 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:35:14,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:14,939 INFO L93 Difference]: Finished difference Result 119 states and 146 transitions. [2022-12-14 13:35:14,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:35:14,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-12-14 13:35:14,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:14,940 INFO L225 Difference]: With dead ends: 119 [2022-12-14 13:35:14,941 INFO L226 Difference]: Without dead ends: 119 [2022-12-14 13:35:14,941 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 13:35:14,942 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 101 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:14,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 105 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:35:14,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-12-14 13:35:14,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-12-14 13:35:14,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 97 states have (on average 1.5051546391752577) internal successors, (146), 118 states have internal predecessors, (146), 0 states have call successors, (0), 0 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 13:35:14,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 146 transitions. [2022-12-14 13:35:14,948 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 146 transitions. Word has length 47 [2022-12-14 13:35:14,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:14,949 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 146 transitions. [2022-12-14 13:35:14,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:35:14,949 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2022-12-14 13:35:14,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-14 13:35:14,950 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:14,950 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:35:14,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 13:35:14,951 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 13:35:14,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:14,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2092506652, now seen corresponding path program 1 times [2022-12-14 13:35:14,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:14,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307467613] [2022-12-14 13:35:14,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:14,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:15,111 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 13:35:15,111 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:15,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307467613] [2022-12-14 13:35:15,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307467613] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:15,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:15,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:35:15,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658293936] [2022-12-14 13:35:15,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:15,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:35:15,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:15,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:35:15,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:35:15,113 INFO L87 Difference]: Start difference. First operand 119 states and 146 transitions. Second operand has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:35:15,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:15,271 INFO L93 Difference]: Finished difference Result 118 states and 145 transitions. [2022-12-14 13:35:15,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 13:35:15,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-12-14 13:35:15,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:15,272 INFO L225 Difference]: With dead ends: 118 [2022-12-14 13:35:15,272 INFO L226 Difference]: Without dead ends: 118 [2022-12-14 13:35:15,272 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 13:35:15,273 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 141 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:15,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 49 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:35:15,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-12-14 13:35:15,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-12-14 13:35:15,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 97 states have (on average 1.4948453608247423) internal successors, (145), 117 states have internal predecessors, (145), 0 states have call successors, (0), 0 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 13:35:15,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 145 transitions. [2022-12-14 13:35:15,279 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 145 transitions. Word has length 47 [2022-12-14 13:35:15,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:15,279 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 145 transitions. [2022-12-14 13:35:15,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:35:15,280 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 145 transitions. [2022-12-14 13:35:15,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-14 13:35:15,280 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:15,280 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:35:15,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 13:35:15,281 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 13:35:15,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:15,281 INFO L85 PathProgramCache]: Analyzing trace with hash 2092506653, now seen corresponding path program 1 times [2022-12-14 13:35:15,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:15,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729063116] [2022-12-14 13:35:15,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:15,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:15,650 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 13:35:15,650 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:15,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729063116] [2022-12-14 13:35:15,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729063116] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:15,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:15,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:35:15,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188999770] [2022-12-14 13:35:15,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:15,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:35:15,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:15,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:35:15,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:35:15,652 INFO L87 Difference]: Start difference. First operand 118 states and 145 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:35:15,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:15,929 INFO L93 Difference]: Finished difference Result 117 states and 144 transitions. [2022-12-14 13:35:15,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 13:35:15,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-12-14 13:35:15,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:15,930 INFO L225 Difference]: With dead ends: 117 [2022-12-14 13:35:15,930 INFO L226 Difference]: Without dead ends: 117 [2022-12-14 13:35:15,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 13:35:15,930 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 210 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:15,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 61 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:35:15,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-12-14 13:35:15,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-12-14 13:35:15,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 97 states have (on average 1.4845360824742269) internal successors, (144), 116 states have internal predecessors, (144), 0 states have call successors, (0), 0 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 13:35:15,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 144 transitions. [2022-12-14 13:35:15,935 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 144 transitions. Word has length 47 [2022-12-14 13:35:15,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:15,935 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 144 transitions. [2022-12-14 13:35:15,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:35:15,936 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 144 transitions. [2022-12-14 13:35:15,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-14 13:35:15,937 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:15,937 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, 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 13:35:15,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 13:35:15,937 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 13:35:15,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:15,938 INFO L85 PathProgramCache]: Analyzing trace with hash 854210081, now seen corresponding path program 1 times [2022-12-14 13:35:15,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:15,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143032340] [2022-12-14 13:35:15,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:15,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:16,310 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 13:35:16,310 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:16,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143032340] [2022-12-14 13:35:16,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143032340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:16,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:16,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:35:16,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185115978] [2022-12-14 13:35:16,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:16,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 13:35:16,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:16,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 13:35:16,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 13:35:16,312 INFO L87 Difference]: Start difference. First operand 117 states and 144 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 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 13:35:16,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:16,561 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2022-12-14 13:35:16,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:35:16,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2022-12-14 13:35:16,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:16,562 INFO L225 Difference]: With dead ends: 116 [2022-12-14 13:35:16,562 INFO L226 Difference]: Without dead ends: 115 [2022-12-14 13:35:16,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 13:35:16,563 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 69 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:16,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 129 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:35:16,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-12-14 13:35:16,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-12-14 13:35:16,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.1979166666666667) internal successors, (115), 114 states have internal predecessors, (115), 0 states have call successors, (0), 0 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 13:35:16,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2022-12-14 13:35:16,568 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 49 [2022-12-14 13:35:16,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:16,568 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2022-12-14 13:35:16,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 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 13:35:16,568 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2022-12-14 13:35:16,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-14 13:35:16,569 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:16,569 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, 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 13:35:16,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 13:35:16,569 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 13:35:16,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:16,570 INFO L85 PathProgramCache]: Analyzing trace with hash -116424314, now seen corresponding path program 1 times [2022-12-14 13:35:16,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:16,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920250489] [2022-12-14 13:35:16,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:16,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:16,752 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 13:35:16,752 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:16,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920250489] [2022-12-14 13:35:16,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920250489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:16,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:16,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:35:16,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201517604] [2022-12-14 13:35:16,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:16,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:35:16,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:16,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:35:16,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:35:16,754 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 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 13:35:16,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:16,887 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2022-12-14 13:35:16,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:35:16,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-12-14 13:35:16,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:16,888 INFO L225 Difference]: With dead ends: 114 [2022-12-14 13:35:16,888 INFO L226 Difference]: Without dead ends: 114 [2022-12-14 13:35:16,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 13:35:16,889 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 198 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:16,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 52 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:35:16,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-12-14 13:35:16,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-12-14 13:35:16,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 96 states have (on average 1.1875) internal successors, (114), 113 states have internal predecessors, (114), 0 states have call successors, (0), 0 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 13:35:16,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2022-12-14 13:35:16,893 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 52 [2022-12-14 13:35:16,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:16,893 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2022-12-14 13:35:16,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 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 13:35:16,893 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2022-12-14 13:35:16,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-14 13:35:16,894 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:16,894 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, 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 13:35:16,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 13:35:16,895 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 13:35:16,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:16,895 INFO L85 PathProgramCache]: Analyzing trace with hash -116424313, now seen corresponding path program 1 times [2022-12-14 13:35:16,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:16,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385969236] [2022-12-14 13:35:16,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:16,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:17,224 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 13:35:17,224 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:17,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385969236] [2022-12-14 13:35:17,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385969236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:17,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:17,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:35:17,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989008115] [2022-12-14 13:35:17,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:17,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:35:17,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:17,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:35:17,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:35:17,226 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 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 13:35:17,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:17,451 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2022-12-14 13:35:17,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 13:35:17,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-12-14 13:35:17,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:17,451 INFO L225 Difference]: With dead ends: 113 [2022-12-14 13:35:17,452 INFO L226 Difference]: Without dead ends: 113 [2022-12-14 13:35:17,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 13:35:17,452 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 166 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:17,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 59 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:35:17,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-12-14 13:35:17,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-12-14 13:35:17,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 96 states have (on average 1.1770833333333333) internal successors, (113), 112 states have internal predecessors, (113), 0 states have call successors, (0), 0 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 13:35:17,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2022-12-14 13:35:17,454 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 52 [2022-12-14 13:35:17,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:17,454 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2022-12-14 13:35:17,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 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 13:35:17,454 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2022-12-14 13:35:17,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-14 13:35:17,455 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:17,455 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, 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, 1, 1, 1, 1, 1] [2022-12-14 13:35:17,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 13:35:17,455 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 13:35:17,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:17,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1746418733, now seen corresponding path program 1 times [2022-12-14 13:35:17,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:17,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64919575] [2022-12-14 13:35:17,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:17,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:17,617 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 13:35:17,617 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:17,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64919575] [2022-12-14 13:35:17,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64919575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:17,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:17,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:35:17,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081578867] [2022-12-14 13:35:17,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:17,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:35:17,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:17,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:35:17,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:35:17,619 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 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 13:35:17,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:17,758 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2022-12-14 13:35:17,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:35:17,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2022-12-14 13:35:17,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:17,759 INFO L225 Difference]: With dead ends: 112 [2022-12-14 13:35:17,759 INFO L226 Difference]: Without dead ends: 112 [2022-12-14 13:35:17,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 13:35:17,760 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 182 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:17,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 54 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:35:17,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-12-14 13:35:17,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-12-14 13:35:17,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 111 states have internal predecessors, (112), 0 states have call successors, (0), 0 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 13:35:17,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2022-12-14 13:35:17,764 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 57 [2022-12-14 13:35:17,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:17,764 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2022-12-14 13:35:17,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 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 13:35:17,764 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2022-12-14 13:35:17,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-14 13:35:17,765 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:17,765 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, 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, 1, 1, 1, 1, 1] [2022-12-14 13:35:17,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 13:35:17,766 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 13:35:17,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:17,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1746418734, now seen corresponding path program 1 times [2022-12-14 13:35:17,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:17,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194745373] [2022-12-14 13:35:17,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:17,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:17,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:18,079 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 13:35:18,079 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:18,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194745373] [2022-12-14 13:35:18,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194745373] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:18,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:18,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 13:35:18,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144667485] [2022-12-14 13:35:18,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:18,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 13:35:18,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:18,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 13:35:18,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 13:35:18,081 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 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 13:35:18,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:18,338 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2022-12-14 13:35:18,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 13:35:18,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2022-12-14 13:35:18,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:18,339 INFO L225 Difference]: With dead ends: 111 [2022-12-14 13:35:18,339 INFO L226 Difference]: Without dead ends: 111 [2022-12-14 13:35:18,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-14 13:35:18,340 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 210 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:18,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 64 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:35:18,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-12-14 13:35:18,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-12-14 13:35:18,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 96 states have (on average 1.15625) internal successors, (111), 110 states have internal predecessors, (111), 0 states have call successors, (0), 0 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 13:35:18,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2022-12-14 13:35:18,343 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 57 [2022-12-14 13:35:18,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:18,343 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2022-12-14 13:35:18,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 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 13:35:18,343 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2022-12-14 13:35:18,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-14 13:35:18,344 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:18,344 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:35:18,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 13:35:18,345 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 13:35:18,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:18,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1587241545, now seen corresponding path program 1 times [2022-12-14 13:35:18,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:18,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149559241] [2022-12-14 13:35:18,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:18,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:18,498 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 13:35:18,498 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:18,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149559241] [2022-12-14 13:35:18,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149559241] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:18,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:18,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:35:18,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224636335] [2022-12-14 13:35:18,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:18,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:35:18,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:18,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:35:18,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:35:18,500 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 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 13:35:18,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:18,625 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2022-12-14 13:35:18,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:35:18,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-12-14 13:35:18,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:18,626 INFO L225 Difference]: With dead ends: 110 [2022-12-14 13:35:18,626 INFO L226 Difference]: Without dead ends: 110 [2022-12-14 13:35:18,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 13:35:18,627 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 166 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:18,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 56 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:35:18,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-12-14 13:35:18,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-12-14 13:35:18,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.1458333333333333) internal successors, (110), 109 states have internal predecessors, (110), 0 states have call successors, (0), 0 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 13:35:18,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2022-12-14 13:35:18,631 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 62 [2022-12-14 13:35:18,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:18,631 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2022-12-14 13:35:18,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 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 13:35:18,632 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2022-12-14 13:35:18,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-14 13:35:18,632 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:18,633 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:35:18,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 13:35:18,633 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 13:35:18,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:18,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1587241544, now seen corresponding path program 1 times [2022-12-14 13:35:18,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:18,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731087356] [2022-12-14 13:35:18,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:18,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:18,940 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 13:35:18,940 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:18,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731087356] [2022-12-14 13:35:18,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731087356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:18,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:18,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 13:35:18,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443724159] [2022-12-14 13:35:18,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:18,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 13:35:18,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:18,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 13:35:18,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 13:35:18,942 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 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 13:35:19,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:19,237 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2022-12-14 13:35:19,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 13:35:19,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-12-14 13:35:19,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:19,238 INFO L225 Difference]: With dead ends: 109 [2022-12-14 13:35:19,238 INFO L226 Difference]: Without dead ends: 109 [2022-12-14 13:35:19,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-14 13:35:19,239 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 142 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:19,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 67 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:35:19,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-12-14 13:35:19,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-12-14 13:35:19,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.1354166666666667) internal successors, (109), 108 states have internal predecessors, (109), 0 states have call successors, (0), 0 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 13:35:19,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2022-12-14 13:35:19,241 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 62 [2022-12-14 13:35:19,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:19,241 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2022-12-14 13:35:19,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 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 13:35:19,241 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2022-12-14 13:35:19,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-14 13:35:19,242 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:19,242 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:35:19,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 13:35:19,242 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 13:35:19,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:19,242 INFO L85 PathProgramCache]: Analyzing trace with hash -903795138, now seen corresponding path program 1 times [2022-12-14 13:35:19,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:19,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494569977] [2022-12-14 13:35:19,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:19,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:19,369 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 13:35:19,369 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:19,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494569977] [2022-12-14 13:35:19,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494569977] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:19,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:19,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:35:19,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499690524] [2022-12-14 13:35:19,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:19,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:35:19,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:19,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:35:19,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:35:19,371 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:35:19,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:19,528 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2022-12-14 13:35:19,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:35:19,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-12-14 13:35:19,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:19,529 INFO L225 Difference]: With dead ends: 108 [2022-12-14 13:35:19,529 INFO L226 Difference]: Without dead ends: 108 [2022-12-14 13:35:19,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 13:35:19,530 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 150 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:19,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 58 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:35:19,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-12-14 13:35:19,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-12-14 13:35:19,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 96 states have (on average 1.125) internal successors, (108), 107 states have internal predecessors, (108), 0 states have call successors, (0), 0 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 13:35:19,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2022-12-14 13:35:19,534 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 67 [2022-12-14 13:35:19,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:19,534 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2022-12-14 13:35:19,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:35:19,534 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2022-12-14 13:35:19,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-14 13:35:19,535 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:19,535 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:35:19,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 13:35:19,535 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 13:35:19,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:19,535 INFO L85 PathProgramCache]: Analyzing trace with hash -903795137, now seen corresponding path program 1 times [2022-12-14 13:35:19,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:19,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855664673] [2022-12-14 13:35:19,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:19,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:19,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:19,856 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 13:35:19,857 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:19,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855664673] [2022-12-14 13:35:19,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855664673] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:19,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:19,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 13:35:19,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244028760] [2022-12-14 13:35:19,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:19,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 13:35:19,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:19,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 13:35:19,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 13:35:19,858 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:35:20,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:20,113 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2022-12-14 13:35:20,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 13:35:20,113 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-12-14 13:35:20,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:20,114 INFO L225 Difference]: With dead ends: 107 [2022-12-14 13:35:20,114 INFO L226 Difference]: Without dead ends: 107 [2022-12-14 13:35:20,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-14 13:35:20,115 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 187 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:20,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 69 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:35:20,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-12-14 13:35:20,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-12-14 13:35:20,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 96 states have (on average 1.1145833333333333) internal successors, (107), 106 states have internal predecessors, (107), 0 states have call successors, (0), 0 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 13:35:20,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2022-12-14 13:35:20,117 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 67 [2022-12-14 13:35:20,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:20,118 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2022-12-14 13:35:20,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:35:20,118 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2022-12-14 13:35:20,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-12-14 13:35:20,118 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:20,119 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:35:20,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 13:35:20,119 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 13:35:20,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:20,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1477731816, now seen corresponding path program 1 times [2022-12-14 13:35:20,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:20,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048359455] [2022-12-14 13:35:20,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:20,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:20,248 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 13:35:20,248 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:20,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048359455] [2022-12-14 13:35:20,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048359455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:20,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:20,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:35:20,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148745724] [2022-12-14 13:35:20,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:20,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:35:20,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:20,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:35:20,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:35:20,249 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 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 13:35:20,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:20,366 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2022-12-14 13:35:20,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:35:20,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2022-12-14 13:35:20,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:20,368 INFO L225 Difference]: With dead ends: 106 [2022-12-14 13:35:20,368 INFO L226 Difference]: Without dead ends: 106 [2022-12-14 13:35:20,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 13:35:20,369 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 134 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:20,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 60 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:35:20,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-12-14 13:35:20,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-12-14 13:35:20,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 96 states have (on average 1.1041666666666667) internal successors, (106), 105 states have internal predecessors, (106), 0 states have call successors, (0), 0 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 13:35:20,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2022-12-14 13:35:20,372 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 72 [2022-12-14 13:35:20,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:20,372 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2022-12-14 13:35:20,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 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 13:35:20,372 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2022-12-14 13:35:20,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-12-14 13:35:20,373 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:20,373 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:35:20,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 13:35:20,373 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 13:35:20,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:20,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1477731817, now seen corresponding path program 1 times [2022-12-14 13:35:20,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:20,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998208142] [2022-12-14 13:35:20,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:20,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:20,714 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 13:35:20,714 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:20,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998208142] [2022-12-14 13:35:20,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998208142] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:20,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:20,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 13:35:20,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907490445] [2022-12-14 13:35:20,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:20,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 13:35:20,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:20,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 13:35:20,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 13:35:20,715 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 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 13:35:20,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:20,951 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2022-12-14 13:35:20,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 13:35:20,951 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2022-12-14 13:35:20,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:20,951 INFO L225 Difference]: With dead ends: 105 [2022-12-14 13:35:20,951 INFO L226 Difference]: Without dead ends: 105 [2022-12-14 13:35:20,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-14 13:35:20,952 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 174 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:20,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 71 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:35:20,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-12-14 13:35:20,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-12-14 13:35:20,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 96 states have (on average 1.09375) internal successors, (105), 104 states have internal predecessors, (105), 0 states have call successors, (0), 0 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 13:35:20,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2022-12-14 13:35:20,954 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 72 [2022-12-14 13:35:20,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:20,955 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2022-12-14 13:35:20,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 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 13:35:20,955 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2022-12-14 13:35:20,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-12-14 13:35:20,956 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:20,956 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, 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, 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 13:35:20,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 13:35:20,956 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 13:35:20,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:20,957 INFO L85 PathProgramCache]: Analyzing trace with hash -2019888049, now seen corresponding path program 1 times [2022-12-14 13:35:20,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:20,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201013539] [2022-12-14 13:35:20,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:20,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:21,127 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 13:35:21,127 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:21,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201013539] [2022-12-14 13:35:21,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201013539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:21,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:21,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:35:21,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691824074] [2022-12-14 13:35:21,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:21,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:35:21,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:21,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:35:21,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:35:21,128 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 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 13:35:21,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:21,255 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2022-12-14 13:35:21,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:35:21,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-12-14 13:35:21,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:21,256 INFO L225 Difference]: With dead ends: 104 [2022-12-14 13:35:21,256 INFO L226 Difference]: Without dead ends: 104 [2022-12-14 13:35:21,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 13:35:21,257 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 118 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:21,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 62 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:35:21,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-12-14 13:35:21,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-12-14 13:35:21,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 96 states have (on average 1.0833333333333333) internal successors, (104), 103 states have internal predecessors, (104), 0 states have call successors, (0), 0 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 13:35:21,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2022-12-14 13:35:21,259 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 77 [2022-12-14 13:35:21,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:21,259 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2022-12-14 13:35:21,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 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 13:35:21,259 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2022-12-14 13:35:21,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-12-14 13:35:21,259 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:21,259 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, 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, 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 13:35:21,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-14 13:35:21,259 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 13:35:21,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:21,260 INFO L85 PathProgramCache]: Analyzing trace with hash -2019888048, now seen corresponding path program 1 times [2022-12-14 13:35:21,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:21,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158244044] [2022-12-14 13:35:21,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:21,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:21,559 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 13:35:21,559 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:21,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158244044] [2022-12-14 13:35:21,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158244044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:21,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:21,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 13:35:21,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796315394] [2022-12-14 13:35:21,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:21,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 13:35:21,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:21,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 13:35:21,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 13:35:21,561 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 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 13:35:21,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:21,791 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2022-12-14 13:35:21,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 13:35:21,792 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-12-14 13:35:21,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:21,792 INFO L225 Difference]: With dead ends: 103 [2022-12-14 13:35:21,792 INFO L226 Difference]: Without dead ends: 103 [2022-12-14 13:35:21,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-14 13:35:21,793 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 109 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:21,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 73 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:35:21,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-12-14 13:35:21,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-12-14 13:35:21,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 96 states have (on average 1.0729166666666667) internal successors, (103), 102 states have internal predecessors, (103), 0 states have call successors, (0), 0 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 13:35:21,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2022-12-14 13:35:21,796 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 77 [2022-12-14 13:35:21,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:21,796 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2022-12-14 13:35:21,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 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 13:35:21,796 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2022-12-14 13:35:21,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-12-14 13:35:21,797 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:21,797 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, 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, 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, 1, 1, 1, 1] [2022-12-14 13:35:21,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-14 13:35:21,797 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 13:35:21,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:21,798 INFO L85 PathProgramCache]: Analyzing trace with hash 481810970, now seen corresponding path program 1 times [2022-12-14 13:35:21,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:21,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153488516] [2022-12-14 13:35:21,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:21,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:22,103 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 13:35:22,104 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:22,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153488516] [2022-12-14 13:35:22,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153488516] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:22,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:22,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 13:35:22,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178047412] [2022-12-14 13:35:22,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:22,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 13:35:22,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:22,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 13:35:22,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 13:35:22,105 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 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 13:35:22,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:22,344 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2022-12-14 13:35:22,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 13:35:22,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2022-12-14 13:35:22,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:22,345 INFO L225 Difference]: With dead ends: 102 [2022-12-14 13:35:22,345 INFO L226 Difference]: Without dead ends: 102 [2022-12-14 13:35:22,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-14 13:35:22,345 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 101 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:22,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 75 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:35:22,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-12-14 13:35:22,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-12-14 13:35:22,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 96 states have (on average 1.0625) internal successors, (102), 101 states have internal predecessors, (102), 0 states have call successors, (0), 0 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 13:35:22,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2022-12-14 13:35:22,347 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 82 [2022-12-14 13:35:22,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:22,347 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2022-12-14 13:35:22,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 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 13:35:22,348 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2022-12-14 13:35:22,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-12-14 13:35:22,348 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:22,348 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, 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, 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, 1, 1, 1, 1] [2022-12-14 13:35:22,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-14 13:35:22,348 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 13:35:22,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:22,348 INFO L85 PathProgramCache]: Analyzing trace with hash 481810969, now seen corresponding path program 1 times [2022-12-14 13:35:22,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:22,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694385519] [2022-12-14 13:35:22,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:22,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:22,478 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 13:35:22,478 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:22,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694385519] [2022-12-14 13:35:22,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694385519] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:22,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:22,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:35:22,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088120294] [2022-12-14 13:35:22,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:22,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:35:22,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:22,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:35:22,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:35:22,480 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 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 13:35:22,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:22,619 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2022-12-14 13:35:22,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:35:22,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2022-12-14 13:35:22,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:22,620 INFO L225 Difference]: With dead ends: 101 [2022-12-14 13:35:22,620 INFO L226 Difference]: Without dead ends: 101 [2022-12-14 13:35:22,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 13:35:22,621 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 99 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:22,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 64 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:35:22,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-12-14 13:35:22,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-12-14 13:35:22,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 100 states have internal predecessors, (101), 0 states have call successors, (0), 0 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 13:35:22,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2022-12-14 13:35:22,624 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 82 [2022-12-14 13:35:22,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:22,624 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2022-12-14 13:35:22,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 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 13:35:22,624 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2022-12-14 13:35:22,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-14 13:35:22,624 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:22,624 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:35:22,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-14 13:35:22,625 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 13:35:22,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:22,625 INFO L85 PathProgramCache]: Analyzing trace with hash 2022477408, now seen corresponding path program 1 times [2022-12-14 13:35:22,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:22,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128724524] [2022-12-14 13:35:22,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:22,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:22,755 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 13:35:22,755 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:22,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128724524] [2022-12-14 13:35:22,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128724524] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:22,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:22,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:35:22,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300068996] [2022-12-14 13:35:22,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:22,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:35:22,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:22,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:35:22,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:35:22,757 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 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 13:35:22,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:22,892 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2022-12-14 13:35:22,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:35:22,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2022-12-14 13:35:22,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:22,894 INFO L225 Difference]: With dead ends: 101 [2022-12-14 13:35:22,894 INFO L226 Difference]: Without dead ends: 101 [2022-12-14 13:35:22,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 13:35:22,894 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 77 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:22,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 72 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:35:22,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-12-14 13:35:22,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2022-12-14 13:35:22,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 99 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:35:22,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2022-12-14 13:35:22,897 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 87 [2022-12-14 13:35:22,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:22,898 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2022-12-14 13:35:22,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 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 13:35:22,898 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2022-12-14 13:35:22,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-14 13:35:22,898 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:22,898 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:35:22,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-14 13:35:22,899 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr99REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 13:35:22,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:22,899 INFO L85 PathProgramCache]: Analyzing trace with hash 2022477409, now seen corresponding path program 1 times [2022-12-14 13:35:22,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:22,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101027137] [2022-12-14 13:35:22,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:22,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:23,273 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 13:35:23,273 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:23,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101027137] [2022-12-14 13:35:23,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101027137] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:23,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:23,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 13:35:23,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255115454] [2022-12-14 13:35:23,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:23,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 13:35:23,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:23,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 13:35:23,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 13:35:23,274 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand has 6 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 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 13:35:23,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:23,509 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2022-12-14 13:35:23,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 13:35:23,509 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2022-12-14 13:35:23,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:23,510 INFO L225 Difference]: With dead ends: 100 [2022-12-14 13:35:23,510 INFO L226 Difference]: Without dead ends: 100 [2022-12-14 13:35:23,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-14 13:35:23,511 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 93 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:23,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 82 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:35:23,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-12-14 13:35:23,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2022-12-14 13:35:23,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 96 states have (on average 1.03125) internal successors, (99), 98 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:35:23,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2022-12-14 13:35:23,514 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 87 [2022-12-14 13:35:23,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:23,514 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2022-12-14 13:35:23,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 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 13:35:23,514 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2022-12-14 13:35:23,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-14 13:35:23,515 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:23,515 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:35:23,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-14 13:35:23,515 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 13:35:23,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:23,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1900606228, now seen corresponding path program 1 times [2022-12-14 13:35:23,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:23,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879080093] [2022-12-14 13:35:23,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:23,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:24,041 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 13:35:24,041 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:24,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879080093] [2022-12-14 13:35:24,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879080093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:24,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:24,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-12-14 13:35:24,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287706895] [2022-12-14 13:35:24,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:24,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-14 13:35:24,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:24,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-14 13:35:24,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2022-12-14 13:35:24,043 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand has 17 states, 17 states have (on average 5.470588235294118) internal successors, (93), 17 states have internal predecessors, (93), 0 states have call successors, (0), 0 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 13:35:24,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:24,484 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2022-12-14 13:35:24,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 13:35:24,485 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.470588235294118) internal successors, (93), 17 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2022-12-14 13:35:24,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:24,485 INFO L225 Difference]: With dead ends: 108 [2022-12-14 13:35:24,485 INFO L226 Difference]: Without dead ends: 108 [2022-12-14 13:35:24,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-12-14 13:35:24,486 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 89 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:24,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 321 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 13:35:24,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-12-14 13:35:24,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2022-12-14 13:35:24,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 101 states have internal predecessors, (102), 0 states have call successors, (0), 0 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 13:35:24,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2022-12-14 13:35:24,488 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 93 [2022-12-14 13:35:24,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:24,488 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2022-12-14 13:35:24,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.470588235294118) internal successors, (93), 17 states have internal predecessors, (93), 0 states have call successors, (0), 0 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 13:35:24,488 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2022-12-14 13:35:24,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-14 13:35:24,488 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:24,488 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:35:24,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-14 13:35:24,489 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 13:35:24,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:24,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1900591398, now seen corresponding path program 1 times [2022-12-14 13:35:24,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:24,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789864559] [2022-12-14 13:35:24,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:24,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:24,612 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 13:35:24,612 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:24,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789864559] [2022-12-14 13:35:24,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789864559] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:24,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:24,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:35:24,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586578142] [2022-12-14 13:35:24,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:24,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:35:24,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:24,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:35:24,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:35:24,613 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 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 13:35:24,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:24,740 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2022-12-14 13:35:24,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:35:24,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2022-12-14 13:35:24,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:24,741 INFO L225 Difference]: With dead ends: 101 [2022-12-14 13:35:24,741 INFO L226 Difference]: Without dead ends: 101 [2022-12-14 13:35:24,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 13:35:24,741 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 65 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:24,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 72 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:35:24,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-12-14 13:35:24,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-12-14 13:35:24,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 99 states have (on average 1.02020202020202) internal successors, (101), 100 states have internal predecessors, (101), 0 states have call successors, (0), 0 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 13:35:24,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2022-12-14 13:35:24,744 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 93 [2022-12-14 13:35:24,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:24,744 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2022-12-14 13:35:24,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 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 13:35:24,744 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2022-12-14 13:35:24,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-14 13:35:24,745 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:24,745 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:35:24,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-14 13:35:24,745 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 13:35:24,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:24,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1900591399, now seen corresponding path program 1 times [2022-12-14 13:35:24,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:24,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356974828] [2022-12-14 13:35:24,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:24,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:25,075 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 13:35:25,075 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:25,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356974828] [2022-12-14 13:35:25,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356974828] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:25,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:25,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 13:35:25,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971872780] [2022-12-14 13:35:25,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:25,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 13:35:25,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:25,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 13:35:25,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 13:35:25,076 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand has 7 states, 6 states have (on average 15.5) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 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 13:35:25,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:25,291 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2022-12-14 13:35:25,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 13:35:25,291 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.5) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2022-12-14 13:35:25,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:25,291 INFO L225 Difference]: With dead ends: 100 [2022-12-14 13:35:25,291 INFO L226 Difference]: Without dead ends: 100 [2022-12-14 13:35:25,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-12-14 13:35:25,292 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 125 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:25,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 82 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:35:25,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-12-14 13:35:25,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-12-14 13:35:25,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.0101010101010102) internal successors, (100), 99 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:35:25,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2022-12-14 13:35:25,293 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 93 [2022-12-14 13:35:25,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:25,293 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2022-12-14 13:35:25,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.5) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 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 13:35:25,294 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2022-12-14 13:35:25,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-14 13:35:25,294 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:25,294 INFO L195 NwaCegarLoop]: trace histogram [2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:35:25,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-14 13:35:25,294 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 13:35:25,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:25,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1120172761, now seen corresponding path program 1 times [2022-12-14 13:35:25,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:25,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637190824] [2022-12-14 13:35:25,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:25,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:25,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:25,789 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 13:35:25,789 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:25,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637190824] [2022-12-14 13:35:25,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637190824] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:35:25,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718852331] [2022-12-14 13:35:25,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:25,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:35:25,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccf03799-d2f2-4db5-b937-b5bc561cfd5d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:35:25,791 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccf03799-d2f2-4db5-b937-b5bc561cfd5d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:35:25,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccf03799-d2f2-4db5-b937-b5bc561cfd5d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 13:35:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:26,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 1270 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 13:35:26,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:35:26,280 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 13:35:26,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:35:26,638 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 13:35:26,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718852331] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:35:26,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [445320555] [2022-12-14 13:35:26,654 INFO L159 IcfgInterpreter]: Started Sifa with 97 locations of interest [2022-12-14 13:35:26,654 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 13:35:26,659 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 13:35:26,663 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 13:35:26,663 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 13:35:26,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:26,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:26,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:26,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:26,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:26,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:26,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:26,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:26,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:26,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:26,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:26,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:26,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:26,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:26,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:26,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 15 select indices, 15 select index equivalence classes, 121 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 126 [2022-12-14 13:35:26,955 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 13:35:26,971 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 13:35:27,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-14 13:35:27,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-14 13:35:27,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 13:35:27,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 13:35:27,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-12-14 13:35:27,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-12-14 13:35:27,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-12-14 13:35:27,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-12-14 13:35:27,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2022-12-14 13:35:27,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2022-12-14 13:35:27,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 54 [2022-12-14 13:35:27,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 54 [2022-12-14 13:35:27,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 62 [2022-12-14 13:35:27,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 62 [2022-12-14 13:35:27,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 70 [2022-12-14 13:35:27,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 70 [2022-12-14 13:35:27,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 78 [2022-12-14 13:35:28,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 78 [2022-12-14 13:35:28,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 55 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 86 [2022-12-14 13:35:28,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 55 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 86 [2022-12-14 13:35:28,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 66 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 94 [2022-12-14 13:35:28,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 66 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 94 [2022-12-14 13:35:28,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 78 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 102 [2022-12-14 13:35:28,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 78 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 102 [2022-12-14 13:35:28,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 91 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 110 [2022-12-14 13:35:28,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 91 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 110 [2022-12-14 13:35:28,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 105 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 118 [2022-12-14 13:35:28,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 105 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 118 [2022-12-14 13:35:28,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 15 select indices, 15 select index equivalence classes, 120 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 126 [2022-12-14 13:35:28,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 15 select indices, 15 select index equivalence classes, 120 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 126 [2022-12-14 13:35:29,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 16 select indices, 16 select index equivalence classes, 136 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 134 [2022-12-14 13:35:29,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 16 select indices, 16 select index equivalence classes, 136 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 134 [2022-12-14 13:35:29,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 17 select indices, 17 select index equivalence classes, 153 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 142 [2022-12-14 13:35:29,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 17 select indices, 17 select index equivalence classes, 153 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 142 [2022-12-14 13:35:29,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 18 select indices, 18 select index equivalence classes, 171 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 150 [2022-12-14 13:35:29,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 18 select indices, 18 select index equivalence classes, 171 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 150 [2022-12-14 13:35:29,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 19 select indices, 19 select index equivalence classes, 190 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 158 [2022-12-14 13:35:29,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 19 select indices, 19 select index equivalence classes, 190 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 158 [2022-12-14 13:35:29,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 20 select indices, 20 select index equivalence classes, 210 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 166 [2022-12-14 13:35:30,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 20 select indices, 20 select index equivalence classes, 210 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 166 [2022-12-14 13:35:30,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 21 select indices, 21 select index equivalence classes, 231 disjoint index pairs (out of 210 index pairs), introduced 21 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 174 [2022-12-14 13:35:30,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 21 select indices, 21 select index equivalence classes, 231 disjoint index pairs (out of 210 index pairs), introduced 21 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 174 [2022-12-14 13:35:30,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 22 select indices, 22 select index equivalence classes, 253 disjoint index pairs (out of 231 index pairs), introduced 22 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 182 [2022-12-14 13:35:30,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 22 select indices, 22 select index equivalence classes, 253 disjoint index pairs (out of 231 index pairs), introduced 22 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 182 [2022-12-14 13:35:30,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 23 select indices, 23 select index equivalence classes, 276 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 190 [2022-12-14 13:35:30,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 23 select indices, 23 select index equivalence classes, 276 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 190 [2022-12-14 13:35:30,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 24 select indices, 24 select index equivalence classes, 300 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 198 [2022-12-14 13:35:31,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 24 select indices, 24 select index equivalence classes, 300 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 198 [2022-12-14 13:35:31,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 25 select indices, 25 select index equivalence classes, 325 disjoint index pairs (out of 300 index pairs), introduced 25 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 206 [2022-12-14 13:35:31,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 25 select indices, 25 select index equivalence classes, 325 disjoint index pairs (out of 300 index pairs), introduced 25 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 206 [2022-12-14 13:35:31,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 26 select indices, 26 select index equivalence classes, 351 disjoint index pairs (out of 325 index pairs), introduced 26 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 214 [2022-12-14 13:35:31,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 26 select indices, 26 select index equivalence classes, 351 disjoint index pairs (out of 325 index pairs), introduced 26 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 214 [2022-12-14 13:35:31,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 27 select indices, 27 select index equivalence classes, 378 disjoint index pairs (out of 351 index pairs), introduced 27 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 222 [2022-12-14 13:35:31,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 27 select indices, 27 select index equivalence classes, 378 disjoint index pairs (out of 351 index pairs), introduced 27 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 222 [2022-12-14 13:35:32,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 28 select indices, 28 select index equivalence classes, 406 disjoint index pairs (out of 378 index pairs), introduced 28 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 230 [2022-12-14 13:35:32,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 28 select indices, 28 select index equivalence classes, 406 disjoint index pairs (out of 378 index pairs), introduced 28 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 230 [2022-12-14 13:35:32,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 29 select indices, 29 select index equivalence classes, 435 disjoint index pairs (out of 406 index pairs), introduced 29 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 238 [2022-12-14 13:35:32,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 29 select indices, 29 select index equivalence classes, 435 disjoint index pairs (out of 406 index pairs), introduced 29 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 238 [2022-12-14 13:35:32,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 30 select indices, 30 select index equivalence classes, 465 disjoint index pairs (out of 435 index pairs), introduced 30 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 246 [2022-12-14 13:35:33,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 30 select indices, 30 select index equivalence classes, 465 disjoint index pairs (out of 435 index pairs), introduced 30 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 246 [2022-12-14 13:35:33,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 31 select indices, 31 select index equivalence classes, 496 disjoint index pairs (out of 465 index pairs), introduced 31 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 254 [2022-12-14 13:35:33,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 31 select indices, 31 select index equivalence classes, 496 disjoint index pairs (out of 465 index pairs), introduced 31 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 254 [2022-12-14 13:35:33,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 32 select indices, 32 select index equivalence classes, 528 disjoint index pairs (out of 496 index pairs), introduced 32 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 262 [2022-12-14 13:35:33,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 32 select indices, 32 select index equivalence classes, 528 disjoint index pairs (out of 496 index pairs), introduced 32 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 262 [2022-12-14 13:35:34,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 33 select indices, 33 select index equivalence classes, 561 disjoint index pairs (out of 528 index pairs), introduced 33 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 270 [2022-12-14 13:35:34,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 33 select indices, 33 select index equivalence classes, 561 disjoint index pairs (out of 528 index pairs), introduced 33 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 270 [2022-12-14 13:35:34,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 34 select indices, 34 select index equivalence classes, 595 disjoint index pairs (out of 561 index pairs), introduced 34 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 278 [2022-12-14 13:35:34,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 34 select indices, 34 select index equivalence classes, 595 disjoint index pairs (out of 561 index pairs), introduced 34 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 278 [2022-12-14 13:35:34,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 35 select indices, 35 select index equivalence classes, 630 disjoint index pairs (out of 595 index pairs), introduced 35 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 286 [2022-12-14 13:35:34,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 35 select indices, 35 select index equivalence classes, 630 disjoint index pairs (out of 595 index pairs), introduced 35 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 286 [2022-12-14 13:35:35,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 36 select indices, 36 select index equivalence classes, 666 disjoint index pairs (out of 630 index pairs), introduced 36 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 294 [2022-12-14 13:35:35,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 36 select indices, 36 select index equivalence classes, 666 disjoint index pairs (out of 630 index pairs), introduced 36 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 294 [2022-12-14 13:35:35,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 37 select indices, 37 select index equivalence classes, 703 disjoint index pairs (out of 666 index pairs), introduced 37 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 302 [2022-12-14 13:35:35,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 37 select indices, 37 select index equivalence classes, 703 disjoint index pairs (out of 666 index pairs), introduced 37 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 302 [2022-12-14 13:35:35,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 38 select indices, 38 select index equivalence classes, 741 disjoint index pairs (out of 703 index pairs), introduced 38 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 310 [2022-12-14 13:35:36,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 38 select indices, 38 select index equivalence classes, 741 disjoint index pairs (out of 703 index pairs), introduced 38 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 310 [2022-12-14 13:35:36,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 39 select indices, 39 select index equivalence classes, 780 disjoint index pairs (out of 741 index pairs), introduced 39 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 318 [2022-12-14 13:35:36,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 39 select indices, 39 select index equivalence classes, 780 disjoint index pairs (out of 741 index pairs), introduced 39 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 318 [2022-12-14 13:35:36,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 40 select indices, 40 select index equivalence classes, 820 disjoint index pairs (out of 780 index pairs), introduced 40 new quantified variables, introduced 0 case distinctions, treesize of input 451 treesize of output 570 [2022-12-14 13:35:37,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 40 select indices, 40 select index equivalence classes, 820 disjoint index pairs (out of 780 index pairs), introduced 40 new quantified variables, introduced 0 case distinctions, treesize of input 451 treesize of output 570 [2022-12-14 13:35:37,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:37,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:37,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:37,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:37,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:37,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:37,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:37,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:37,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:37,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:37,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:37,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:37,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:37,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:37,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:37,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:37,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:37,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:37,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:37,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:37,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:37,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:37,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:37,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:37,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:37,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:37,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:37,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:37,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:37,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:37,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:35:37,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 17 select indices, 17 select index equivalence classes, 138 disjoint index pairs (out of 136 index pairs), introduced 16 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 139 [2022-12-14 13:35:55,543 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 13:37:29,027 WARN L233 SmtUtils]: Spent 6.57s on a formula simplification. DAG size of input: 1016 DAG size of output: 1007 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:37:35,885 WARN L233 SmtUtils]: Spent 5.87s on a formula simplification. DAG size of input: 1026 DAG size of output: 1013 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:37:42,382 WARN L233 SmtUtils]: Spent 5.42s on a formula simplification. DAG size of input: 1039 DAG size of output: 1026 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:37:50,309 WARN L233 SmtUtils]: Spent 6.81s on a formula simplification. DAG size of input: 1049 DAG size of output: 1030 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:37:58,676 WARN L233 SmtUtils]: Spent 7.17s on a formula simplification. DAG size of input: 1055 DAG size of output: 1031 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:38:06,385 WARN L233 SmtUtils]: Spent 6.48s on a formula simplification. DAG size of input: 1063 DAG size of output: 1037 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:38:15,356 WARN L233 SmtUtils]: Spent 7.58s on a formula simplification. DAG size of input: 1074 DAG size of output: 1047 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:38:25,352 WARN L233 SmtUtils]: Spent 8.26s on a formula simplification. DAG size of input: 1084 DAG size of output: 1051 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:38:34,557 WARN L233 SmtUtils]: Spent 7.65s on a formula simplification. DAG size of input: 1086 DAG size of output: 1048 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:38:43,933 WARN L233 SmtUtils]: Spent 7.99s on a formula simplification. DAG size of input: 1094 DAG size of output: 1054 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:38:53,753 WARN L233 SmtUtils]: Spent 8.40s on a formula simplification. DAG size of input: 1105 DAG size of output: 1064 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:39:01,675 WARN L233 SmtUtils]: Spent 6.10s on a formula simplification. DAG size of input: 1115 DAG size of output: 1068 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:39:10,189 WARN L233 SmtUtils]: Spent 6.85s on a formula simplification. DAG size of input: 1119 DAG size of output: 1067 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:39:18,428 WARN L233 SmtUtils]: Spent 6.75s on a formula simplification. DAG size of input: 1127 DAG size of output: 1073 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:39:28,660 WARN L233 SmtUtils]: Spent 8.33s on a formula simplification. DAG size of input: 1138 DAG size of output: 1083 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:39:38,794 WARN L233 SmtUtils]: Spent 8.52s on a formula simplification. DAG size of input: 1148 DAG size of output: 1087 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:39:48,913 WARN L233 SmtUtils]: Spent 8.43s on a formula simplification. DAG size of input: 1152 DAG size of output: 1086 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:39:59,368 WARN L233 SmtUtils]: Spent 8.72s on a formula simplification. DAG size of input: 1160 DAG size of output: 1092 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:40:10,144 WARN L233 SmtUtils]: Spent 9.03s on a formula simplification. DAG size of input: 1171 DAG size of output: 1102 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:40:20,350 WARN L233 SmtUtils]: Spent 8.40s on a formula simplification. DAG size of input: 1181 DAG size of output: 1106 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:40:30,098 WARN L233 SmtUtils]: Spent 7.98s on a formula simplification. DAG size of input: 1185 DAG size of output: 1105 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:40:39,971 WARN L233 SmtUtils]: Spent 7.86s on a formula simplification. DAG size of input: 1193 DAG size of output: 1111 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:40:50,574 WARN L233 SmtUtils]: Spent 8.72s on a formula simplification. DAG size of input: 1204 DAG size of output: 1121 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:41:01,655 WARN L233 SmtUtils]: Spent 9.03s on a formula simplification. DAG size of input: 1214 DAG size of output: 1125 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:41:13,549 WARN L233 SmtUtils]: Spent 9.84s on a formula simplification. DAG size of input: 1218 DAG size of output: 1124 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:41:25,447 WARN L233 SmtUtils]: Spent 9.82s on a formula simplification. DAG size of input: 1226 DAG size of output: 1130 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:41:37,641 WARN L233 SmtUtils]: Spent 10.06s on a formula simplification. DAG size of input: 1237 DAG size of output: 1140 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:41:49,532 WARN L233 SmtUtils]: Spent 9.67s on a formula simplification. DAG size of input: 1247 DAG size of output: 1144 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:42:00,076 WARN L233 SmtUtils]: Spent 8.39s on a formula simplification. DAG size of input: 1251 DAG size of output: 1143 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:42:11,504 WARN L233 SmtUtils]: Spent 9.23s on a formula simplification. DAG size of input: 1259 DAG size of output: 1149 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:42:22,898 WARN L233 SmtUtils]: Spent 9.12s on a formula simplification. DAG size of input: 1270 DAG size of output: 1159 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:42:34,601 WARN L233 SmtUtils]: Spent 9.38s on a formula simplification. DAG size of input: 1280 DAG size of output: 1163 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:42:47,641 WARN L233 SmtUtils]: Spent 10.54s on a formula simplification. DAG size of input: 1284 DAG size of output: 1162 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:43:00,510 WARN L233 SmtUtils]: Spent 10.39s on a formula simplification. DAG size of input: 1292 DAG size of output: 1168 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:43:13,147 WARN L233 SmtUtils]: Spent 10.04s on a formula simplification. DAG size of input: 1303 DAG size of output: 1178 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:43:26,562 WARN L233 SmtUtils]: Spent 10.76s on a formula simplification. DAG size of input: 1313 DAG size of output: 1182 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:43:37,190 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7264#(and (<= |ULTIMATE.start_main_~__tmp_9~0#1| 1) (<= |ULTIMATE.start_main_~__tmp_6~0#1| 1) (<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__Id_MCDC_92~4#1|) (<= 0 ~__tmp_1075_2~0.base) (<= 0 |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_0~1#1.offset|) (<= 1 ~__tmp_1075_1~0) (<= 0 |ULTIMATE.start_main_~__tmp_1~0#1.offset|) (= ~__tmp_1075_2~0.offset |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_0~8#1.offset|) (<= 0 |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_0~5#1.offset|) (<= 0 |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_0~6#1.offset|) (<= 4 |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_2~4#1|) (= |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_1~4#1| 1) (<= |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_2~1#1| 1) (<= |ULTIMATE.start_main_~__tmp_3~0#1| 1) (= ~__tmp_1075_1~0 |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_1~8#1|) (<= 0 |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_0~4#1.base|) (<= 0 |ULTIMATE.start_main_~__tmp_1~0#1.base|) (<= |ULTIMATE.start_main_~__VERIFIER_assert__Id_MCDC_92~1#1| 1) (<= 0 |ULTIMATE.start_main_~#main__Id_MCDC_119~0#1.base|) (<= ~__tmp_1075_1~0 1) (<= |ULTIMATE.start_main_~__tmp_8~0#1| 1) (<= 0 |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_0~0#1.offset|) (<= |ULTIMATE.start_main_~__tmp_7~0#1| 1) (<= 1 |ULTIMATE.start_main_~__tmp_9~0#1|) (<= |ULTIMATE.start_main_~__tmp_1~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_0~1#1.base|) (<= 0 |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_0~7#1.offset|) (<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__Id_MCDC_92~5#1|) (<= |ULTIMATE.start_main_~__VERIFIER_assert__Id_MCDC_92~3#1| 1) (<= |ULTIMATE.start_main_~__tmp_10~0#1| 1) (<= |ULTIMATE.start_main_~__tmp_5~0#1| 1) (not (< (mod ~Id_MCDC_93~0 4294967296) 42)) (<= 2 |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_2~2#1|) (<= 1 |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_1~3#1|) (<= 0 |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_0~6#1.base|) (<= 1 |ULTIMATE.start_main_~__tmp_10~0#1|) (= |ULTIMATE.start_main_~__VERIFIER_assert__Id_MCDC_92~10#1| 0) (<= 1 |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_1~5#1|) (<= |#NULL.offset| 0) (<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__Id_MCDC_92~7#1|) (<= 1 |ULTIMATE.start_main_~__tmp_6~0#1|) (<= |ULTIMATE.start_main_~__VERIFIER_assert__Id_MCDC_92~6#1| 1) (<= |ULTIMATE.start_main_~__VERIFIER_assert__Id_MCDC_92~5#1| 1) (= ~__tmp_1075_0~0 |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_2~8#1|) (<= |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_1~3#1| 1) (<= |ULTIMATE.start_main_~__VERIFIER_assert__Id_MCDC_92~4#1| 1) (<= ~__return_main~0 0) (<= 1 |ULTIMATE.start_main_~__tmp_7~0#1|) (<= 1 |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_1~6#1|) (<= 0 |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_0~0#1.base|) (<= 5 |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_2~5#1|) (<= 3 |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_2~3#1|) (<= 1 |ULTIMATE.start_main_~__tmp_3~0#1|) (<= 1 |ULTIMATE.start_main_~__tmp_5~0#1|) (<= 0 |ULTIMATE.start_main_~#Id_MCDC_89__Id_MCDC_95~0#1.offset|) (= |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_2~0#1| 0) (<= 0 |ULTIMATE.start_main_~#Id_MCDC_89__Id_MCDC_95~0#1.base|) (<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__Id_MCDC_92~3#1|) (<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__Id_MCDC_92~2#1|) (<= |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_2~6#1| 6) (<= |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_1~6#1| 1) (<= 0 |ULTIMATE.start_main_~Id_MCDC_89__Id_MCDC_88~0#1.base|) (= |ULTIMATE.start_main_~main__Id_MCDC_116~0#1| 0) (<= |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_2~5#1| 5) (<= 1 |ULTIMATE.start_main_~__tmp_8~0#1|) (<= 1 |ULTIMATE.start_main_~__tmp_4~0#1|) (= |ULTIMATE.start_main_~Id_MCDC_89__Id_MCDC_96~0#1| ~Id_MCDC_93~0) (= |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_1~7#1| 1) (<= 0 |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_0~3#1.base|) (<= 0 |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_0~2#1.base|) (= |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_1~2#1| 1) (<= |ULTIMATE.start_main_~__tmp_4~0#1| 1) (<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__Id_MCDC_92~0#1|) (<= 1 |ULTIMATE.start_main_~__tmp_2~0#1|) (<= 0 |ULTIMATE.start_main_~#main__Id_MCDC_119~0#1.offset|) (<= 0 |ULTIMATE.start_main_~Id_MCDC_89__Id_MCDC_88~0#1.offset|) (<= 0 ~__return_main~0) (<= 0 ~__tmp_1075_2~0.offset) (= |ULTIMATE.start_main_~__tmp_12~0#1| |ULTIMATE.start_main_~__VERIFIER_assert__Id_MCDC_92~10#1|) (<= |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_2~4#1| 4) (= |ULTIMATE.start_main_~main__Id_MCDC_115~0#1| 0) (<= |ULTIMATE.start_main_~Id_MCDC_89__Id_MCDC_88~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_0~3#1.offset|) (= |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_0~8#1.base| ~__tmp_1075_2~0.base) (<= |ULTIMATE.start_main_~__VERIFIER_assert__Id_MCDC_92~7#1| 1) (<= 6 |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_2~6#1|) (<= 0 |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_0~5#1.base|) (<= |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_1~0#1| 1) (<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__Id_MCDC_92~1#1|) (<= |ULTIMATE.start_main_~__VERIFIER_assert__Id_MCDC_92~8#1| 1) (<= 7 |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_2~7#1|) (<= |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_2~2#1| 2) (<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__Id_MCDC_92~6#1|) (<= |ULTIMATE.start_main_~__tmp_2~0#1| 1) (<= 0 |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_0~2#1.offset|) (<= 8 ~__tmp_1075_0~0) (<= 0 |#NULL.offset|) (<= 1 |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_2~1#1|) (<= |ULTIMATE.start_main_~__VERIFIER_assert__Id_MCDC_92~0#1| 1) (<= |ULTIMATE.start_main_~__VERIFIER_assert__Id_MCDC_92~2#1| 1) (<= 9 |ULTIMATE.start_main_~Id_MCDC_89__Id_MCDC_96~0#1|) (<= |ULTIMATE.start_main_~#main__Id_MCDC_119~0#1.offset| 0) (<= |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_1~1#1| 1) (<= |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_1~5#1| 1) (<= 0 |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_0~4#1.offset|) (<= 1 |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_1~1#1|) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_1~9#1| 0) (<= |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_2~7#1| 7) (<= |ULTIMATE.start_main_~#Id_MCDC_89__Id_MCDC_95~0#1.offset| 0) (<= |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_2~3#1| 3) (<= 0 |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_0~7#1.base|) (<= 1 |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_1~0#1|) (= |#NULL.base| 0) (<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__Id_MCDC_92~8#1|))' at error location [2022-12-14 13:43:37,191 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 13:43:37,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:43:37,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 31 [2022-12-14 13:43:37,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607236973] [2022-12-14 13:43:37,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:43:37,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-14 13:43:37,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:43:37,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-14 13:43:37,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1939, Invalid=11171, Unknown=0, NotChecked=0, Total=13110 [2022-12-14 13:43:37,194 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand has 31 states, 31 states have (on average 5.580645161290323) internal successors, (173), 31 states have internal predecessors, (173), 0 states have call successors, (0), 0 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 13:43:44,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:43:44,222 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2022-12-14 13:43:44,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-14 13:43:44,222 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 5.580645161290323) internal successors, (173), 31 states have internal predecessors, (173), 0 states have call successors, (0), 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 99 [2022-12-14 13:43:44,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:43:44,223 INFO L225 Difference]: With dead ends: 175 [2022-12-14 13:43:44,223 INFO L226 Difference]: Without dead ends: 175 [2022-12-14 13:43:44,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 198 SyntacticMatches, 2 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6719 ImplicationChecksByTransitivity, 468.3s TimeCoverageRelationStatistics Valid=2802, Invalid=15288, Unknown=0, NotChecked=0, Total=18090 [2022-12-14 13:43:44,225 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 493 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 13:43:44,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 382 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 13:43:44,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-12-14 13:43:44,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2022-12-14 13:43:44,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.0058479532163742) internal successors, (172), 171 states have internal predecessors, (172), 0 states have call successors, (0), 0 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 13:43:44,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2022-12-14 13:43:44,229 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 99 [2022-12-14 13:43:44,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:43:44,229 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2022-12-14 13:43:44,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 5.580645161290323) internal successors, (173), 31 states have internal predecessors, (173), 0 states have call successors, (0), 0 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 13:43:44,229 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2022-12-14 13:43:44,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-12-14 13:43:44,230 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:43:44,230 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:43:44,238 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccf03799-d2f2-4db5-b937-b5bc561cfd5d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 13:43:44,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccf03799-d2f2-4db5-b937-b5bc561cfd5d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-14 13:43:44,432 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-14 13:43:44,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:43:44,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1377894027, now seen corresponding path program 2 times [2022-12-14 13:43:44,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:43:44,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709479047] [2022-12-14 13:43:44,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:43:44,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:43:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:43:45,595 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 507 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:43:45,595 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:43:45,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709479047] [2022-12-14 13:43:45,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709479047] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:43:45,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480525350] [2022-12-14 13:43:45,595 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 13:43:45,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:43:45,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccf03799-d2f2-4db5-b937-b5bc561cfd5d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:43:45,596 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccf03799-d2f2-4db5-b937-b5bc561cfd5d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:43:45,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccf03799-d2f2-4db5-b937-b5bc561cfd5d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 13:43:50,016 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 13:43:50,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:43:50,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 1312 conjuncts, 70 conjunts are in the unsatisfiable core [2022-12-14 13:43:50,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:43:58,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:43:58,627 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:43:58,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 121 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 136 case distinctions, treesize of input 232 treesize of output 232 [2022-12-14 13:44:00,217 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 36 proven. 63 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2022-12-14 13:44:00,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:44:05,904 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2022-12-14 13:44:05,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480525350] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:44:05,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [711700791] [2022-12-14 13:44:05,908 INFO L159 IcfgInterpreter]: Started Sifa with 97 locations of interest [2022-12-14 13:44:05,909 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 13:44:05,909 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 13:44:05,909 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 13:44:05,909 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 13:44:05,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:05,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:05,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:05,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:05,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:05,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:05,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:05,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:05,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:06,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:06,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:06,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:06,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:06,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:06,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:06,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 15 select indices, 15 select index equivalence classes, 121 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 126 [2022-12-14 13:44:06,062 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 13:44:06,074 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 13:44:06,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-14 13:44:06,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-14 13:44:06,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 13:44:06,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 13:44:06,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-12-14 13:44:06,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-12-14 13:44:06,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-12-14 13:44:06,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-12-14 13:44:06,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2022-12-14 13:44:06,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2022-12-14 13:44:06,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 54 [2022-12-14 13:44:06,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 54 [2022-12-14 13:44:06,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 62 [2022-12-14 13:44:06,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 62 [2022-12-14 13:44:06,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 70 [2022-12-14 13:44:06,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 70 [2022-12-14 13:44:06,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 78 [2022-12-14 13:44:06,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 78 [2022-12-14 13:44:06,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 55 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 86 [2022-12-14 13:44:06,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 55 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 86 [2022-12-14 13:44:07,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 66 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 94 [2022-12-14 13:44:07,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 66 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 94 [2022-12-14 13:44:07,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 78 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 102 [2022-12-14 13:44:07,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 78 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 102 [2022-12-14 13:44:07,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 91 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 110 [2022-12-14 13:44:07,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 91 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 110 [2022-12-14 13:44:07,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 105 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 118 [2022-12-14 13:44:07,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 105 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 118 [2022-12-14 13:44:07,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 15 select indices, 15 select index equivalence classes, 120 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 126 [2022-12-14 13:44:07,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 15 select indices, 15 select index equivalence classes, 120 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 126 [2022-12-14 13:44:07,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 16 select indices, 16 select index equivalence classes, 136 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 134 [2022-12-14 13:44:07,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 16 select indices, 16 select index equivalence classes, 136 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 134 [2022-12-14 13:44:07,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 17 select indices, 17 select index equivalence classes, 153 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 142 [2022-12-14 13:44:08,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 17 select indices, 17 select index equivalence classes, 153 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 142 [2022-12-14 13:44:08,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 18 select indices, 18 select index equivalence classes, 171 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 150 [2022-12-14 13:44:08,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 18 select indices, 18 select index equivalence classes, 171 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 150 [2022-12-14 13:44:08,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 19 select indices, 19 select index equivalence classes, 190 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 158 [2022-12-14 13:44:08,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 19 select indices, 19 select index equivalence classes, 190 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 158 [2022-12-14 13:44:08,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 20 select indices, 20 select index equivalence classes, 210 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 166 [2022-12-14 13:44:08,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 20 select indices, 20 select index equivalence classes, 210 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 166 [2022-12-14 13:44:08,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 21 select indices, 21 select index equivalence classes, 231 disjoint index pairs (out of 210 index pairs), introduced 21 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 174 [2022-12-14 13:44:08,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 21 select indices, 21 select index equivalence classes, 231 disjoint index pairs (out of 210 index pairs), introduced 21 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 174 [2022-12-14 13:44:08,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 22 select indices, 22 select index equivalence classes, 253 disjoint index pairs (out of 231 index pairs), introduced 22 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 182 [2022-12-14 13:44:09,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 22 select indices, 22 select index equivalence classes, 253 disjoint index pairs (out of 231 index pairs), introduced 22 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 182 [2022-12-14 13:44:09,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 23 select indices, 23 select index equivalence classes, 276 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 190 [2022-12-14 13:44:09,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 23 select indices, 23 select index equivalence classes, 276 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 190 [2022-12-14 13:44:09,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 24 select indices, 24 select index equivalence classes, 300 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 198 [2022-12-14 13:44:09,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 24 select indices, 24 select index equivalence classes, 300 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 198 [2022-12-14 13:44:09,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 25 select indices, 25 select index equivalence classes, 325 disjoint index pairs (out of 300 index pairs), introduced 25 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 206 [2022-12-14 13:44:09,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 25 select indices, 25 select index equivalence classes, 325 disjoint index pairs (out of 300 index pairs), introduced 25 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 206 [2022-12-14 13:44:09,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 26 select indices, 26 select index equivalence classes, 351 disjoint index pairs (out of 325 index pairs), introduced 26 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 214 [2022-12-14 13:44:10,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 26 select indices, 26 select index equivalence classes, 351 disjoint index pairs (out of 325 index pairs), introduced 26 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 214 [2022-12-14 13:44:10,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 27 select indices, 27 select index equivalence classes, 378 disjoint index pairs (out of 351 index pairs), introduced 27 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 222 [2022-12-14 13:44:10,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 27 select indices, 27 select index equivalence classes, 378 disjoint index pairs (out of 351 index pairs), introduced 27 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 222 [2022-12-14 13:44:10,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 28 select indices, 28 select index equivalence classes, 406 disjoint index pairs (out of 378 index pairs), introduced 28 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 230 [2022-12-14 13:44:10,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 28 select indices, 28 select index equivalence classes, 406 disjoint index pairs (out of 378 index pairs), introduced 28 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 230 [2022-12-14 13:44:10,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 29 select indices, 29 select index equivalence classes, 435 disjoint index pairs (out of 406 index pairs), introduced 29 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 238 [2022-12-14 13:44:10,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 29 select indices, 29 select index equivalence classes, 435 disjoint index pairs (out of 406 index pairs), introduced 29 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 238 [2022-12-14 13:44:11,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 30 select indices, 30 select index equivalence classes, 465 disjoint index pairs (out of 435 index pairs), introduced 30 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 246 [2022-12-14 13:44:11,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 30 select indices, 30 select index equivalence classes, 465 disjoint index pairs (out of 435 index pairs), introduced 30 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 246 [2022-12-14 13:44:11,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 31 select indices, 31 select index equivalence classes, 496 disjoint index pairs (out of 465 index pairs), introduced 31 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 254 [2022-12-14 13:44:11,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 31 select indices, 31 select index equivalence classes, 496 disjoint index pairs (out of 465 index pairs), introduced 31 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 254 [2022-12-14 13:44:11,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 32 select indices, 32 select index equivalence classes, 528 disjoint index pairs (out of 496 index pairs), introduced 32 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 262 [2022-12-14 13:44:11,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 32 select indices, 32 select index equivalence classes, 528 disjoint index pairs (out of 496 index pairs), introduced 32 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 262 [2022-12-14 13:44:12,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 33 select indices, 33 select index equivalence classes, 561 disjoint index pairs (out of 528 index pairs), introduced 33 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 270 [2022-12-14 13:44:12,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 33 select indices, 33 select index equivalence classes, 561 disjoint index pairs (out of 528 index pairs), introduced 33 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 270 [2022-12-14 13:44:12,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 34 select indices, 34 select index equivalence classes, 595 disjoint index pairs (out of 561 index pairs), introduced 34 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 278 [2022-12-14 13:44:12,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 34 select indices, 34 select index equivalence classes, 595 disjoint index pairs (out of 561 index pairs), introduced 34 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 278 [2022-12-14 13:44:12,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 35 select indices, 35 select index equivalence classes, 630 disjoint index pairs (out of 595 index pairs), introduced 35 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 286 [2022-12-14 13:44:13,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 35 select indices, 35 select index equivalence classes, 630 disjoint index pairs (out of 595 index pairs), introduced 35 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 286 [2022-12-14 13:44:13,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 36 select indices, 36 select index equivalence classes, 666 disjoint index pairs (out of 630 index pairs), introduced 36 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 294 [2022-12-14 13:44:13,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 36 select indices, 36 select index equivalence classes, 666 disjoint index pairs (out of 630 index pairs), introduced 36 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 294 [2022-12-14 13:44:13,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 37 select indices, 37 select index equivalence classes, 703 disjoint index pairs (out of 666 index pairs), introduced 37 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 302 [2022-12-14 13:44:13,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 37 select indices, 37 select index equivalence classes, 703 disjoint index pairs (out of 666 index pairs), introduced 37 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 302 [2022-12-14 13:44:14,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 38 select indices, 38 select index equivalence classes, 741 disjoint index pairs (out of 703 index pairs), introduced 38 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 310 [2022-12-14 13:44:14,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 38 select indices, 38 select index equivalence classes, 741 disjoint index pairs (out of 703 index pairs), introduced 38 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 310 [2022-12-14 13:44:14,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 39 select indices, 39 select index equivalence classes, 780 disjoint index pairs (out of 741 index pairs), introduced 39 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 318 [2022-12-14 13:44:14,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 39 select indices, 39 select index equivalence classes, 780 disjoint index pairs (out of 741 index pairs), introduced 39 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 318 [2022-12-14 13:44:15,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 40 select indices, 40 select index equivalence classes, 820 disjoint index pairs (out of 780 index pairs), introduced 40 new quantified variables, introduced 0 case distinctions, treesize of input 451 treesize of output 570 [2022-12-14 13:44:15,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:15,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:15,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:15,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:15,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:15,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:15,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:15,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:15,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:15,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:15,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:15,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:15,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:15,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:15,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:15,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:15,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:15,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:15,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:15,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:15,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:15,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:15,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:15,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:15,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:15,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:15,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:15,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:15,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:15,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:15,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:44:15,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 17 select indices, 17 select index equivalence classes, 138 disjoint index pairs (out of 136 index pairs), introduced 16 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 139 [2022-12-14 13:44:15,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 40 select indices, 40 select index equivalence classes, 820 disjoint index pairs (out of 780 index pairs), introduced 40 new quantified variables, introduced 0 case distinctions, treesize of input 451 treesize of output 570 [2022-12-14 13:44:33,830 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 13:46:15,612 WARN L233 SmtUtils]: Spent 6.42s on a formula simplification. DAG size of input: 1016 DAG size of output: 1007 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:46:23,391 WARN L233 SmtUtils]: Spent 6.36s on a formula simplification. DAG size of input: 1026 DAG size of output: 1013 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:46:31,878 WARN L233 SmtUtils]: Spent 7.04s on a formula simplification. DAG size of input: 1039 DAG size of output: 1026 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:46:40,685 WARN L233 SmtUtils]: Spent 7.27s on a formula simplification. DAG size of input: 1049 DAG size of output: 1030 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:46:48,729 WARN L233 SmtUtils]: Spent 6.39s on a formula simplification. DAG size of input: 1053 DAG size of output: 1029 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:46:57,658 WARN L233 SmtUtils]: Spent 7.32s on a formula simplification. DAG size of input: 1061 DAG size of output: 1035 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:47:05,767 WARN L233 SmtUtils]: Spent 6.33s on a formula simplification. DAG size of input: 1072 DAG size of output: 1045 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:47:14,053 WARN L233 SmtUtils]: Spent 6.47s on a formula simplification. DAG size of input: 1082 DAG size of output: 1049 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:47:24,446 WARN L233 SmtUtils]: Spent 8.56s on a formula simplification. DAG size of input: 1086 DAG size of output: 1048 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:47:35,003 WARN L233 SmtUtils]: Spent 8.71s on a formula simplification. DAG size of input: 1094 DAG size of output: 1054 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:47:44,411 WARN L233 SmtUtils]: Spent 7.51s on a formula simplification. DAG size of input: 1105 DAG size of output: 1064 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:47:53,919 WARN L233 SmtUtils]: Spent 7.58s on a formula simplification. DAG size of input: 1115 DAG size of output: 1068 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:48:03,162 WARN L233 SmtUtils]: Spent 7.21s on a formula simplification. DAG size of input: 1119 DAG size of output: 1067 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:48:13,647 WARN L233 SmtUtils]: Spent 7.81s on a formula simplification. DAG size of input: 1127 DAG size of output: 1073 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:48:24,004 WARN L233 SmtUtils]: Spent 8.00s on a formula simplification. DAG size of input: 1138 DAG size of output: 1083 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:48:34,180 WARN L233 SmtUtils]: Spent 7.80s on a formula simplification. DAG size of input: 1148 DAG size of output: 1087 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:48:44,440 WARN L233 SmtUtils]: Spent 7.98s on a formula simplification. DAG size of input: 1152 DAG size of output: 1086 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:48:55,345 WARN L233 SmtUtils]: Spent 8.53s on a formula simplification. DAG size of input: 1160 DAG size of output: 1092 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:49:06,243 WARN L233 SmtUtils]: Spent 8.60s on a formula simplification. DAG size of input: 1171 DAG size of output: 1102 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:49:17,939 WARN L233 SmtUtils]: Spent 9.28s on a formula simplification. DAG size of input: 1181 DAG size of output: 1106 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)